#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  long long arr[n];
  int i;
  for (i = 0; i < n; i++) cin >> arr[i];
  vector<bool> rmfld(n, false);
  vector<bool>::iterator itr;
  for (i = 0; i < n; i++) {
    int val = (i + arr[i]) % n;
    if (val < 0) val = n + val;
    rmfld[val] = true;
  }
  for (itr = rmfld.begin(); itr != rmfld.end(); itr++) {
    if (!(*itr)) break;
  }
  if (itr != rmfld.end())
    cout << "NO" << '\n';
  else
    cout << "YES" << '\n';
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
