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