#include <bits/stdc++.h>
using namespace std;
int row[] = {0, -1, 0, 1};
int col[] = {-1, 0, 1, 0};
const long long MAX = 1000;
const long long mod = 1e9 + 7;
void solve(long long test) {
  long long n;
  cin >> n;
  vector<long long> v(n);
  vector<bool> vis(n, false);
  for (long long i = 0; i < n; i++) {
    cin >> v[i];
  }
  long long flag = 0;
  for (long long i = 0; i < n; i++) {
    long long x = i + v[i];
    if (x < 0) {
      x = ((x % n) + n) % n;
    }
    if (x >= 0) {
      x = x % n;
    }
    if (vis[x] == true) {
      flag = 1;
      break;
    }
    vis[x] = true;
  }
  if (flag == 1) {
    cout << "NO"
         << "\n";
  } else {
    cout << "YES"
         << "\n";
  }
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  cin >> t;
  for (long long i = 1; i <= t; i++) {
    solve(i);
  }
  return 0;
}
