#include <bits/stdc++.h>
using namespace std;
vector<long long int> primes;
void sieve() {
  bool prime[10000001];
  memset(prime, true, sizeof(prime));
  prime[0] = prime[1] = false;
  for (long long int i = 2; i * i <= 10000001; i++) {
    if (prime[i]) {
      for (long long int j = i * i; j < 10000001; j += i) prime[j] = false;
    }
  }
  long long int count = 0;
  for (long long int i = 0; i < 10000001; i++) {
    if (prime[i]) count++;
    primes.push_back(count);
  }
}
void solve() {
  long long int n;
  cin >> n;
  long long int x;
  set<long long int> s;
  for (long long int i = 0; i < n; i++) cin >> x, s.insert(x);
  (s.size() == n) ? cout << "NO"
                         << "\n"
                  : cout << "YES"
                         << "\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
}
