#include <bits/stdc++.h>
using namespace std;
const int M = 200005;
int A[M], mark[M];
int main() {
  int T, n;
  scanf("%d", &T);
  while (T-- && scanf("%d", &n)) {
    for (int i = 0; i < n; i++) {
      scanf("%d", &A[i]);
      A[i] = ((A[i] + i) % n + n) % n;
    }
    sort(A, A + n);
    memset(mark, 0, sizeof(mark));
    int cnt = 0;
    for (int i = 0; i < n; i++) {
      if (!mark[A[i]]) cnt++;
      mark[A[i]] = 1;
    }
    puts(cnt == n ? "Yes" : "No");
  }
  return 0;
}
