#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int a[N];
int ind[N];
bool flag;
int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      a[i] %= n;
      if (i + a[i] < 0) a[i] += n;
      if (i + a[i] >= n) a[i] -= n;
      ++ind[i + a[i]];
    }
    flag = true;
    for (int i = 0; i < n; i++)
      if (ind[i] > 1) {
        puts("NO");
        flag = false;
        break;
      }
    if (flag == true) puts("YES");
    memset(ind, 0, sizeof(ind));
  }
  return 0;
}
