#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  vector<long long> v(n);
  for (int i = 0; i < n; i++) cin >> v[i];
  bool isNO = false;
  for (int i = 0; i < n - 1 && !isNO; i++)
    for (int j = i + 1; j < n && !isNO; j++)
      if ((v[j] - v[i] + j - i) % n == 0) {
        isNO = true;
        cout << "NO\n";
      }
  if (!isNO) cout << "YES\n";
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
