#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 1;
int accept() {
  int b[N] = {0};
  int d[N] = {0};
  int n;
  cin >> n;
  int mx, check;
  for (int i = 0; i < n; i++) cin >> b[i];
  sort(b, b + n);
  for (int i = 1; i < n; i++) {
    if (b[i] == b[i - 1]) {
      cout << "YES"
           << "\n";
      return 0;
    }
  }
  cout << "NO"
       << "\n";
  return 0;
}
int main() {
  int t = 1;
  cin >> t;
  while (t--) {
    accept();
  }
  return 0;
}
