#include <bits/stdc++.h>
using namespace std;
int n;
int b[1005];
map<int, int> ct;
int k = 0;
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    scanf("%d", &n);
    ct.clear();
    k = 0;
    for (int i = 1; i <= n; i++) {
      scanf("%d", &b[i]);
      if (ct[b[i]] == 0) k++;
      ct[b[i]] = 1;
    }
    if (k != n)
      printf("YES\n");
    else
      printf("NO\n");
  }
}
