#include <bits/stdc++.h>
using namespace std;
set<int> s;
int main() {
  int t, n, now;
  scanf("%d", &t);
  while (t--) {
    int flag = 0;
    s.clear();
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
      scanf("%d", &now);
      if (now < 0) now += ((-now + n) / n * n);
      now %= n;
      if (s.find((now + i) % n) != s.end()) flag = 1;
      s.insert((now + i) % n);
    }
    if (flag)
      printf("NO\n");
    else
      printf("YES\n");
  }
  return 0;
}
