#include <bits/stdc++.h>
using namespace std;
using pll = pair<long long, long long>;
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t, i, x, j, y, z, k, n;
  long long tt;
  cin >> tt;
  for (long long _tt = 0; _tt < tt; _tt++) {
    cin >> n;
    long long a[n], b[n];
    for (i = 0; i < n; i += 1) {
      cin >> a[i];
      b[i] = i;
      b[i] += a[i];
      b[i] %= n;
      b[i] = (b[i] + n) % n;
    }
    sort(b, b + n);
    for (i = 0; i < n; i += 1) {
      if (b[i] != i) break;
    }
    if (i == n)
      cout << "YES" << '\n';
    else
      cout << "NO" << '\n';
  }
}
