#include <bits/stdc++.h>
using namespace std;
int t, n, a[200005];
int visited[200005];
bool solve() {
  for (int i = 0; i < n; i++) {
    visited[(i + a[i]) % n]++;
    if (visited[(i + a[i]) % n] > 1) return false;
  }
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> t;
  while (t--) {
    cin >> n;
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      a[i] = a[i] % n;
      if (a[i] < 0) a[i] += n;
      visited[i] = 0;
    }
    bool ok = solve();
    cout << (ok ? "YES\n" : "NO\n");
  }
  return 0;
}
