#include <bits/stdc++.h>
using std::max;
using std::min;
using std::set;
const int maxn = 200005;
long long t, n, l, r;
set<long long> status;
long long a[maxn];
void read(long long &x) {
  x = 0;
  long long f = 1;
  char ch = getchar();
  while (ch > '9' || ch < '0') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  x = x * f;
}
int main() {
  read(t);
  while (t--) {
    status.clear();
    l = 0x3f3f3f3f3f3f3f3f;
    r = 0;
    bool has_ans = true;
    read(n);
    for (int i = 0; i < n; i++) read(a[i]);
    for (int i = 0; i < n; i++) {
      long long tmp = (i + ((a[i] % n) + n) % n) % n;
      l = min(l, tmp);
      r = max(r, tmp);
      if (status.count(tmp) > 0) {
        has_ans = false;
        break;
      } else {
        status.insert(tmp);
      }
    }
    if (has_ans)
      printf("YES\n");
    else
      printf("NO\n");
  }
  return 0;
}
