#include <bits/stdc++.h>
using namespace std;
const int d4i[4] = {-1, 0, 1, 0}, d4j[4] = {0, 1, 0, -1};
const int d8i[8] = {-1, -1, 0, 1, 1, 1, 0, -1},
          d8j[8] = {0, 1, 1, 1, 0, -1, -1, -1};
template <typename T_n>
void read(T_n &n) {
  cin >> n;
}
template <typename T_n, typename T_a>
void read(T_a a[], T_n n) {
  for (int i = 0; i < n; ++i) cin >> a[i];
}
template <typename T_n, typename T_a>
void read(vector<T_a> &a, T_n n) {
  a.resize(n);
  for (int i = 0; i < n; ++i) cin >> a[i];
}
void _init_() { ios_base::sync_with_stdio(0), cin.tie(0); }
const int N = 1000 + 9, SEG = 131072;
const int Mod_M = 1e9 + 7;
void solve() {
  int n, b[N];
  map<int, int> cnt;
  bool ans = 0;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%d", b + i);
    ++cnt[b[i]];
    if (cnt[b[i]] > 1) ans = 1;
  }
  (ans) ? puts("YES") : puts("NO");
}
int main() {
  _init_();
  int t;
  scanf("%d", &t);
  while (t--) {
    solve();
  }
  return 0;
}
