#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n;
  cin >> n;
  int x;
  bool ans = false;
  unordered_map<int, int> mp;
  for (int i = 0; i < n; i++) {
    cin >> x;
    mp[x]++;
    if (mp[x] >= 2) ans = true;
  }
  if (ans) {
    cout << "YES\n";
    return;
  } else {
    cout << "NO\n";
    return;
  }
}
int main() {
  long long test;
  cin >> test;
  while (test--) solve();
}
