#include <bits/stdc++.h>
using namespace std;
long long int MOD = 1e9 + 7;
void solve() {
  int n;
  cin >> n;
  map<long long int, long long int> ma;
  for (int i = 0; i < n; i++) {
    long long int x;
    cin >> x;
    x = (x + i) % n;
    if (x < 0) x += n;
    ma[x]++;
  }
  for (auto i : ma) {
    if (i.second > 1) {
      cout << "NO";
      return;
    }
  }
  cout << "YES";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL), cout.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    solve();
    cout << "\n";
  }
  return 0;
}
