#include <bits/stdc++.h>
using namespace std;
map<int, int> m;
void solve() {
  int n;
  cin >> n;
  m.clear();
  int rooms[n];
  for (long long i = 0; i < n; i++) cin >> rooms[i];
  int ans = 1;
  for (long long i = 0; i < n; i++) {
    int val = ((i + rooms[i]) % n + n) % n;
    if (!m[val])
      m[val]++;
    else
      ans = 0;
  }
  if (ans)
    cout << "YES\n";
  else
    cout << "NO\n";
}
int main() {
  long long t;
  t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
}
