#include <bits/stdc++.h>
using namespace std;
int n;
int A[200003];
void solve() {
  scanf("%d", &n);
  vector<int> ori;
  vector<int> vec;
  for (int i = 0; i < n; i++) ori.push_back(i);
  for (int i = 0; i < n; i++) {
    scanf("%d", &A[i]);
    vec.push_back(((i + A[i]) % n + n) % n);
  }
  sort(vec.begin(), vec.end());
  if (vec == ori)
    printf("YES\n");
  else
    printf("NO\n");
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    solve();
  }
}
