#include <bits/stdc++.h>
using namespace std;
long long fact(long long n);
long long nCr(long long n, long long r) {
  return fact(n) / (fact(r) * fact(n - r));
}
long long fact(long long n) {
  long long res = 1;
  for (long long i = 2; i <= n; i++) res = res * i;
  return res;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long x, long long y) { return (x / gcd(x, y)) * y; }
void solve() {
  long long n, i, j, ans = 0, k = 2, sum = 0, var = 1;
  cin >> n;
  long long b[n];
  unordered_map<long long, long long> mpp;
  for (i = 0; i < n; i++) {
    cin >> b[i];
    mpp[b[i]]++;
  }
  for (auto el : mpp) {
    if (el.second > 1) {
      cout << "YES" << endl;
      return;
    }
  }
  cout << "NO" << endl;
  return;
}
int main() {
  long long t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
