#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops")
using namespace std;
const int maxn = 200100;
int n, a[maxn];
bool vis[maxn];
void solve() {
  cin >> n;
  for (int i = 0; i < n; i++) vis[i] = 0;
  for (int i = 0; i < n; i++) cin >> a[i], a[i] = ((a[i] % n) + n) % n;
  for (int i = 0; i < n; i++) {
    if (vis[(a[i] + i) % n]) return cout << "NO\n", void();
    vis[(a[i] + i) % n] = 1;
  }
  cout << "YES\n";
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
}
