#include <bits/stdc++.h>
using namespace std;
const long long sz = 5e3 + 5, mod = 1e9 + 7;
long long t, n, m, k, q;
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  t = 1;
  cin >> t;
  while (t--) {
    cin >> n;
    vector<long long> v(n);
    for (long long i = 0; i < n; i++) cin >> v[i];
    map<long long, long long> mp;
    bool flag = 1;
    for (long long i = 0; i < n; i++) {
      long long x = i + v[i];
      x %= n;
      x += n;
      x %= n;
      if (mp.find(x) != mp.end()) {
        flag = 0;
        break;
      }
      mp[x];
    }
    if (flag)
      cout << "YES\n";
    else
      cout << "NO\n";
  }
  return 0;
}
