#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long miin(long long a, long long b) {
  if (a < b)
    return a;
  else {
    return b;
  }
}
long long maax(long long a, long long b) {
  if (a > b) {
    return a;
  } else {
    return b;
  }
}
long long inter(long long a, long long b, long long c, long long d) {
  if ((a > d) || (c > b)) return 0;
  return 1;
}
int main() {
  int t;
  cin >> t;
  long long a[100009];
  a[1] = 2;
  for (long long i = 2; i < 100008; i++) {
    a[i] = a[i - 1] + (i - 1) + (2 * i);
  }
  for (int o = 0; o < t; o++) {
    long long n;
    cin >> n;
    long long a[n];
    for (long long i = 0; i < n; i++) cin >> a[i];
    vector<long long> v;
    for (long long i = 0; i < n; i++) {
      v.push_back(i + a[i % n]);
    }
    sort(v.begin(), v.end());
    int c = 0;
    for (int i = 1; i < n; i++) {
      if (v[i] == v[i - 1]) {
        c = 1;
        break;
      }
    }
    if (c == 1) {
      cout << "NO" << endl;
    } else {
      for (int i = 0; i < n; i++) {
        v[i] = v[i] % n;
        if (v[i] < 0) {
          v[i] = n + v[i];
        }
      }
      sort(v.begin(), v.end());
      int cc = 0;
      for (int i = 1; i < n; i++) {
        if (v[i] == v[i - 1]) {
          cc = 1;
          break;
        }
      }
      if (cc == 0) {
        cout << "YES" << endl;
      } else {
        cout << "NO" << endl;
      }
    }
  }
  return 0;
}
