#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
const long long mod = 1e9 + 7;
long long n, m, t, k, a[N], b[N], tong, ans, d[N], u, v, h[N], st[N], fe[N],
    l[N], r[N];
priority_queue<long long, vector<long long>, greater<long long> > pq;
struct dang {
  long long s, f, l, b;
} e[N];
vector<long long> adj[N], kq;
vector<pair<long long, long long> > w;
void add(long long id) {
  for (; id <= n; id += id & -id) st[id] += v;
}
long long get(long long id) {
  long long total = 0;
  for (; id; id -= id & -id) total += st[id];
  return total;
}
void addfe(long long id) {
  for (; id <= n; id += id & -id) fe[id] += v;
}
long long getfe(long long id) {
  long long total = 0;
  for (; id; id -= id & -id) total += fe[id];
  return total;
}
void sol() {
  cin >> n;
  map<int, int> mp;
  bool ok = false;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    if (mp[a[i]] == 1) ok = true;
    mp[a[i]] = 1;
  }
  if (ok)
    cout << "YES";
  else
    cout << "NO";
  cout << '\n';
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  if (fopen("circlecross"
            ".in",
            "r")) {
    freopen(
        "circlecross"
        ".in",
        "r", stdin);
    freopen(
        "circlecross"
        ".out",
        "w", stdout);
  }
  int ntest = 1;
  cin >> ntest;
  while (ntest-- > 0) sol();
}
