#include <bits/stdc++.h>
using namespace std;
const int sz = (int)(1e6 + 1);
const int mod = (int)(1e9 + 7);
int n;
inline void read() { cin >> n; }
inline void solve() {
  vector<int> storage(n);
  for (int i = 0; i < n; i++) {
    cin >> storage[i];
  }
  bool flag = false;
  sort(storage.begin(), storage.end());
  for (int i = 1; i < n; i++) {
    if (storage[i] == storage[i - 1]) {
      cout << "YES" << endl;
      flag = true;
      break;
    }
  }
  if (!flag) {
    cout << "NO" << endl;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int t;
  cin >> t;
  while (t--) {
    read();
    solve();
  }
}
