#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const vector<int> mods = {998244353, 1000000007, 1000000009};
const long long inf = 3e18;
const double pi = acos(-1.0);
const double eps = 0.0000001;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class... K>
using umap = unordered_map<K...>;
template <class... K>
using uset = unordered_set<K...>;
long long n;
vector<long long> a;
void solve(int _t) {
  cin >> n;
  a.assign(n, 0);
  for (long long i = (0); i < (n); ++i) cin >> a[i];
  for (long long i = (0); i < (n); ++i) {
    a[i] = ((i + a[i]) % n + n) % n;
  }
  sort(begin(a), end(a));
  for (long long i = (0); i < (n); ++i) {
    if (a[i] != i) {
      cout << "NO\n";
      return;
    }
  }
  cout << "YES\n";
}
int main() {
  cin.tie(0)->sync_with_stdio(0);
  cout.precision(13);
  int t = 1;
  cin >> t;
  while (t--) solve(t);
  return 0;
}
