#include <bits/stdc++.h>
using namespace std;
template <typename T>
void out(T x) {
  cout << x << endl;
  exit(0);
}
const int maxn = 1e6 + 5;
int n;
long long a[maxn];
long long mod(long long x, long long n) {
  x %= n;
  x += n;
  x %= n;
  return x;
}
bool solve() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  map<long long, long long> mp;
  for (int i = 0; i < n; i++) {
    long long cur = mod(i + a[mod(i, n)], n);
    mp[cur]++;
  }
  vector<long long> v;
  for (auto p : mp) {
    v.push_back(p.first);
  }
  int len = v.size();
  for (int i = 1; i < len; i++) {
    if (v[i] != v[i - 1] + 1) return false;
  }
  for (auto p : mp) {
    if (p.second > 1) return false;
  }
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    if (solve())
      cout << "YES\n";
    else
      cout << "NO\n";
  }
  return 0;
}
