#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int n, t;
int a[N], b[N];
int main() {
  cin >> t;
  while (t--) {
    cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++) b[i] = i + a[i];
    for (int i = 0; i < n; i++) b[i] = (b[i] % n + n) % n;
    sort(b, b + n);
    int flag = 1;
    for (int i = 0; i < n; i++)
      if (b[i] != i) flag = 0;
    if (flag)
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  return 0;
}
