#include <bits/stdc++.h>
using namespace std;
constexpr int kN = int(2E5 + 10);
int a[kN];
bool solve() {
  int n;
  set<int> s;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 1; i <= n; i++) a[i] %= n;
  for (int i = 1; i <= n; i++)
    if (a[i] < 0) a[i] += n;
  for (int i = 1; i <= n; i++) s.insert((a[i] + i - 1) % n);
  return int(s.size()) == n;
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    if (solve())
      printf("YES\n");
    else
      printf("NO\n");
  }
}
