#include <bits/stdc++.h>
using namespace std;
int t, n, v[200005];
int main() {
  scanf("%d", &t);
  while (t--) {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
      scanf("%d", &v[i]);
      v[i] = ((n + v[i] + i) % n + n) % n;
    }
    sort(v + 1, v + n + 1);
    bool ok = 1;
    for (int i = 1; i < n; i++) {
      if (v[i] == v[i + 1]) ok = 0;
    }
    if (!ok)
      printf("NO\n");
    else
      printf("YES\n");
  }
  return 0;
}
