#include <bits/stdc++.h>
using namespace std;
long long n;
long long mod(long long x) { return (x % n + n) % n; }
bool solve(vector<long long>& a, long long n) {
  vector<bool> vis(n);
  for (long long i = 0; i < n; i++) {
    if (vis[mod(i + a[i])]) return false;
    vis[mod(i + a[i])] = true;
  }
  return true;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t;
  cin >> t;
  while (t--) {
    cin >> n;
    vector<long long> a(n);
    for (long long i = 0; i < n; i++) {
      cin >> a[i];
    }
    if (solve(a, n))
      cout << "YES\n";
    else
      cout << "NO\n";
  }
  return 0;
}
