#include <bits/stdc++.h>
using namespace std;
int main() {
  int t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long arr[n];
    for (int i = 0; i < n; i++) {
      cin >> arr[i];
    }
    set<int> s;
    long long solve, m;
    for (int i = 0; i < n; i++) {
      solve = i + arr[i];
      if (solve >= 0) {
        solve = solve % n;
      } else {
        m = abs(solve) / n;
        m++;
        m = m * n + solve;
        solve = m % n;
      }
      s.insert(solve);
    }
    if (s.size() == n) {
      cout << "YES";
    } else {
      cout << "NO";
    }
    cout << endl;
  }
}
