#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T>
using vec = vector<T>;
template <typename K, typename V>
using umap = unordered_map<K, V>;
template <typename K>
using uset = unordered_set<K>;
void solve() {
  int N;
  cin >> N;
  uset<int> nums;
  for (int i = 0; i < N; i++) {
    int b;
    cin >> b;
    nums.insert(b);
  }
  if (nums.size() < N) {
    cout << "YES" << endl;
  } else {
    cout << "NO" << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int cases;
  cin >> cases;
  while (cases--) {
    solve();
  }
  return 0;
}
