#include <bits/stdc++.h>
using namespace std;
const int N = 3e6 + 105;
const int mod = 998244353;
const double Pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int G = 3, Gi = 332748118;
long long qpow(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long T, n;
long long a[N];
map<long long, int> mp;
int main() {
  scanf("%lld", &T);
  long long num = 1e9;
  while (T--) {
    scanf("%lld", &n);
    mp.clear();
    for (long long i = 0; i < n; ++i) {
      scanf("%lld", &a[i]);
      mp[(i + a[i] % n + n) % n]++;
    }
    int flag = 0;
    for (long long i = 0; i < n; ++i) {
      if (!mp[i] || mp[i] > 1) flag = 1;
    }
    if (flag)
      printf("NO\n");
    else
      printf("YES\n");
  }
  return 0;
}
