#include <bits/stdc++.h>
using namespace std;
using ii = pair<long long, long long>;
using vc = vector<long long>;
using vp = vector<pair<long long, long long>>;
const long long mod = 1e9 + 7;
long long qpow(long long n, long long k) {
  long long ans = 1;
  while (k > 0) {
    if (k & 1) ans = ans * n;
    n = n * n;
    k >>= 1;
  }
  return ans;
}
long long INV(long long x) {
  return x == 1 ? x : 1LL * (mod - mod / x) * INV(mod % x) % mod;
}
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  return a % b == 0 ? b : gcd(b, a % b);
}
const long long MAX = 3e5 + 10;
long long a[MAX];
long long b[MAX];
long long c[MAX];
long long d[MAX];
long long ans[MAX];
long long totol[MAX];
long long to[MAX];
ii aa[MAX];
ii ab[MAX];
vc p[MAX];
long long sum;
void in(long long y) {
  for (long long i = 1; i <= y; ++i) scanf("%lld", &a[i]);
}
void out(long long y) {
  for (long long i = 1; i <= y; ++i) {
    i == y ? printf("%lld\n", a[i]) : printf("%lld ", a[i]);
  }
}
bool cmp(pair<long long, long long> aaa, pair<long long, long long> bbb) {
  return abs(aaa.first) + abs(aaa.second) < abs(bbb.first) + abs(bbb.second);
}
int main() {
  long long n, k, sum, m, len, flag, x, y, h, T, z, q, l, r, g, t;
  long long k1, k2, k3, k4;
  long long v[301][301];
  len = 0;
  string s, st, ss;
  scanf("%lld", &T);
  while (T--) {
    cin >> n;
    for (long long i = (1); i <= (n); ++i) {
      cin >> a[i];
    }
    sort(a + 1, a + n + 1);
    flag = 0;
    for (long long i = (2); i <= (n); ++i)
      if (a[i - 1] == a[i]) flag = 1;
    if (flag)
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
    ;
  }
  return 0;
}
