#include <bits/stdc++.h>
using namespace std;
long long mod(long long a, long long b) { return (a % b + b) % b; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  cin >> t;
  while (t--) {
    long long n, a, flag = 1;
    cin >> n;
    unordered_map<long long, long long> mp;
    for (long long i = 0; i < n; i++) {
      cin >> a;
      long long x = mod(i + a, n);
      if (mp.find(x) != mp.end())
        flag = 0;
      else
        mp[x] = 1;
    }
    if (flag)
      cout << "Yes\n";
    else
      cout << "No\n";
  }
}
