#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  vector<int> arr(n);
  for (int& v : arr) cin >> v;
  unordered_set<int> ecv_class;
  for (int i = 0; i < n; ++i) {
    int new_ec = (arr[i] + i) % n;
    if (new_ec < 0) new_ec += n;
    ecv_class.insert(new_ec);
  }
  if ((int)ecv_class.size() == n) {
    cout << "YES\n";
  } else {
    cout << "NO\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  cin >> t;
  while (t--) solve();
  return 0;
}
