#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  vector<long long> a(n);
  unordered_map<long long, int> rems;
  int ans = 0;
  long long N = ((long long)1e9) * n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    rems[(a[i] + i + N) % n]++;
    if (rems[(a[i] + i + N) % n] > 1) ans = 1;
  }
  cout << (ans ? "NO" : "YES") << endl;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int t = 1;
  cin >> t;
  while (t--) solve();
}
