#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long a[n];
    for (long long i = 0; i < n; i++) {
      cin >> a[i];
    }
    unordered_set<int> s;
    bool flag = 0;
    for (long long i = 0; i < n; i++) {
      long long x = i + a[i];
      long long p = ((x % n) + n) % n;
      if (s.find(p) != s.end()) {
        flag = 1;
        break;
      }
      s.insert(p);
    }
    if (flag == 0) {
      cout << "YES" << endl;
    } else {
      cout << "NO" << endl;
    }
  }
  return 0;
}
