#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 10, INF = 1e9, p = 37, m = 1e9 + 7, l = 18;
vector<long long> input(long long n) {
  vector<long long> v(n);
  for (long long i = 0; i < n; i++) cin >> v[i];
  return v;
}
void solve() {
  long long n, m;
  cin >> n;
  vector<long long> v = input(n);
  vector<long long> mpp(n, 0);
  for (long long i = 0; i < n; i++) {
    mpp[(n + (i + v[i]) % n) % n]++;
  }
  for (long long i = 0; i < n; i++) {
    if (mpp[i] > 1) {
      cout << "NO" << '\n';
      return;
    }
  }
  cout << "YES" << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long q = 1;
  cin >> q;
  while (q--) solve();
}
