#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  long long int ar[n];
  set<long long int> s1;
  for (int i = 0; i < n; i++) {
    cin >> ar[i];
  }
  for (int i = 0; i < n; i++) {
    if (s1.find(ar[i]) != s1.end()) {
      cout << "YES" << endl;
      return;
    } else {
      s1.insert(ar[i]);
    }
  }
  cout << "NO" << endl;
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
