#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5;
long long mod(long long a, long long b) {
  if (a >= 0)
    return a % b;
  else {
    long long i = 1;
    while (a < 0) {
      a += i * b;
      i *= 10;
    }
    return a % b;
  }
}
signed main() {
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long m[n];
    long long cntMod[n];
    for (long long i = 0; i < n; ++i) {
      cin >> m[i];
      cntMod[i] = 0;
    }
    bool flag = 0;
    for (long long i = 0; i < n; ++i) {
      long long k = mod(i + m[mod(i, n)], n);
      cntMod[k]++;
      if (cntMod[k] > 1) {
        flag = 1;
        break;
      }
    }
    if (flag)
      cout << "No"
           << "\n";
    else
      cout << "Yes"
           << "\n";
  }
  return 0;
}
