#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
long long n, m, t, k;
string s;
long long a[500005];
vector<long long> ans;
long long lower(int num) {
  int l = 0, r = ans.size() - 1;
  while (l < r - 1) {
    int mid = (l + r) / 2;
    if (ans[mid] > num) {
      r = mid;
    } else {
      l = mid;
    }
  }
  return ans[l];
}
int pos[500005];
long long md(long long a) {
  a %= n;
  while (a >= n) a -= n;
  while (a < 0) a += n;
  return a;
}
int main() {
  ios::sync_with_stdio(0);
  cin >> t;
  while (t--) {
    cin >> n;
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      pos[i] = 0;
    }
    int num = 0;
    for (int i = 0; i < n; i++) {
      int p = md(i + a[i]);
      if (pos[p] == 0) {
        num++;
      }
      pos[p] = 1;
    }
    if (num == n) {
      cout << "YES\n";
    } else {
      cout << "NO\n";
    }
  }
  return 0;
}
