#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 2e5 + 5;
int t, n, m, k, tmp, ans;
int a[maxn];
set<int> s;
int main() {
  cin >> t;
  while (t--) {
    cin >> n;
    s.clear();
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      m = ((a[i] % n + n) % n + i) % n;
      s.insert(m);
    }
    if (s.size() == n)
      cout << "YES\n";
    else
      cout << "NO\n";
  }
  return 0;
}
