#include <bits/stdc++.h>
using namespace std;
const int N = 300010;
long long n, a[N], t;
map<long long, bool> vis;
int solve() {
  scanf("%lld", &t);
  while (t--) {
    scanf("%lld", &n);
    vis.clear();
    bool imp = 0;
    for (int i = 1; i <= n; i++) {
      scanf("%lld", &a[i]);
      long long nw = (i + a[i]) % n;
      if (nw < 0) nw += n;
      if (vis[nw]) {
        imp = 1;
      }
      vis[nw] = 1;
    }
    if (imp)
      printf("NO\n");
    else
      printf("YES\n");
  }
  return 0;
}
int main() { return solve(); }
