#include <bits/stdc++.h>
using namespace std;
long long int inf = 1e18;
long long int p = 1e9 + 7;
long long int phi(long long int n) {
  long long int result = n;
  for (long long int i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      while (n % i == 0) n /= i;
      result -= result / i;
    }
  }
  if (n > 1) result -= result / n;
  return result;
}
long long int power(long long int x, long long int y, long long int p) {
  long long int res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long int modInverse(long long int n, long long int p) {
  return power(n, p - 2, p);
}
int main() {
  long long int i, j, t, a, b, temp, f, n, q, l, r, x, y, k, m;
  cin >> t;
  while (t--) {
    cin >> n;
    set<long long int> s;
    for (i = 0; i < n; i++) {
      cin >> a;
      s.insert(((a + i) % n + n) % n);
    }
    if (s.size() == n)
      cout << "YES\n";
    else
      cout << "NO\n";
  }
  return 0;
}
