#include <bits/stdc++.h>
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
using namespace std;
const int maxn = 2e5 + 10;
long long a[maxn];
long long vis[maxn * 2];
int main() {
  int q;
  scanf("%d", &q);
  while (q--) {
    int n;
    cin >> n;
    for (int i = 1; i <= n; ++i) {
      cin >> a[i];
      a[i] %= n;
      if (a[i] < 0) {
        a[i] += n;
      }
      vis[(a[i] + i) % n]++;
    }
    int flag = 0;
    for (int i = 1; i <= n; ++i) {
      if (vis[(a[i] + i) % n] != 1) {
        flag = 1;
      }
      vis[(a[i] + i) % n] = 0;
    }
    if (flag == 1) {
      cout << "NO" << endl;
    } else {
      cout << "YES" << endl;
    }
  }
}
