#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n;
  cin >> n;
  long long a[n];
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  set<long long> s;
  for (int i = 0; i < n; ++i) {
    s.insert(((i + a[i] + (long long)1e15) % n) % n);
  }
  if ((long long)s.size() == n)
    cout << "YES\n";
  else
    cout << "NO\n";
  return;
}
int main() {
  long long tt;
  cin >> tt;
  while (tt--) solve();
}
