#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
long long a[maxn];
map<long long, long long> mt;
void solve() {
  for (auto i : mt) {
    if (i.second >= 2) {
      cout << "NO\n";
      return;
    }
  }
  cout << "YES\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    mt.clear();
    int x, n;
    cin >> n;
    for (int i = 1; i <= n; ++i) {
      cin >> x;
      ++mt[((i + x) % n + n) % n];
    }
    solve();
  }
}
