#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const long long INF64 = 3e18 + 1;
const int N = 200555;
const int AMAX = 205;
const int LIM = 1000000000;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const char invdir[]{'L', 'U', 'R', 'D'};
const char dir[]{'R', 'D', 'L', 'U'};
void solve() {
  int n;
  cin >> n;
  vector<int> val, val2;
  for (int i = 1; i <= n; ++i) {
    int a;
    cin >> a;
    a %= n;
    val.push_back(a);
  }
  for (auto el : val) {
    val2.push_back(el);
  }
  set<int> S;
  bool q = 1;
  for (int i = 0; i < val2.size(); ++i) {
    if (S.find((val2[i] + i + n) % n) != S.end()) q = 0;
    S.insert((val2[i] + i + n) % n);
  }
  cout << (q ? "YES" : "NO") << "\n";
}
int main() {
  std::ios_base::sync_with_stdio(0);
  cin.tie(0);
  int T = 1;
  cin >> T;
  int i = 1;
  while (T--) {
    solve();
    i++;
  }
  return 0;
}
