#include <bits/stdc++.h>
using namespace std;
template <typename T>
void print(T t) {
  cout << t << endl;
}
long long n = 0, t = 0;
long long small = -1e18, big = 1e18;
const long long mod = 1e9 + 7;
map<long long, long long> occ;
void print2dVec(vector<vector<long long>> v) {
  for (int i = 0; i < v.size(); ++i) {
    cout << i << " : ";
    for (int j = 0; j < v[i].size(); ++j) {
      cout << v[i][j] << " ";
    }
    print("");
  }
}
void printSet(set<long long> s) {
  for (auto itr = s.begin(); itr != s.end(); ++itr) {
    cout << *itr << " ";
  }
}
long long factorial(int n) {
  long long ans = 1;
  for (int i = 1; i <= n; ++i) {
    ans *= i;
  }
  return ans;
}
long long findGCD(long long a, long long b) {
  if (b == 0) return a;
  return findGCD(b, a % b);
}
bool isprime(long long p) {
  for (int i = 2; i * i <= p; ++i) {
    if (p % i == 0 && p != i) {
      return false;
    }
  }
  return true;
}
bool sortVec(const vector<long long>& v1, const vector<long long>& v2) {
  return v1[0] < v2[0];
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << fixed;
  cout << setprecision(10);
  ;
  cin >> t;
  while (t--) {
    cin >> n;
    vector<long long> a(n);
    for (long long it = 0; it < n; it++) cin >> a[it];
    ;
    bool poss = true;
    occ.clear();
    for (int i = 0; i < n; i++) {
      occ[(((a[i]) % n + n) % n + i) % n] += 1;
      if (occ[(((a[i]) % n + n) % n + i) % n] >= 2) {
        poss = false;
        break;
      }
    }
    for (int i = 0; i < n; ++i) {
      if (occ[i] == 0) {
        poss = false;
        break;
      }
    }
    if (poss) {
      print("YES");
    } else {
      print("NO");
    }
  }
  return 0;
}
