#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000000 + 7;
const long long minim = -1 * mod;
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
bool compare(int a, int b) { return a > b; }
bool isperfect(long long a) {
  long long l = 1, r = a;
  while (l <= r) {
    long long mid = (l + r) / 2;
    if (mid * mid == a) {
      return true;
    } else if (mid * mid < a) {
      l = mid + 1;
    } else {
      r = mid - 1;
    }
  }
  return false;
}
void solve() {
  long long n;
  cin >> n;
  long long b[n];
  for (int i = 0; i < n; i++) {
    cin >> b[i];
  }
  sort(b, b + n);
  int res = 0;
  for (int i = 0; i < n - 1; i++) {
    if (b[i] == b[i + 1]) {
      res = 1;
    }
  }
  if (res) {
    cout << "YES" << endl;
  } else {
    cout << "NO" << endl;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  long long testcase;
  cin >> testcase;
  while (testcase--) solve();
  return 0;
}
