#include <bits/stdc++.h>
using namespace std;
long long n, m, t, k, s, mod = 1e9 + 7;
long long a[200001], b[200001];
int main() {
  cin >> t;
  while (t--) {
    cin >> n;
    int flag = 1;
    for (int i = 0; i < n; i++) cin >> a[i];
    memset(b, 0, sizeof(b));
    for (int i = 0; i < n; i++) {
      k = i + (a[i] % n + n) % n;
      k %= n;
      if (b[k] == 0)
        b[k] = 1;
      else
        flag = 0;
    }
    if (flag == 1)
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
}
