#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  scanf("%d", &n);
  vector<int> b(n);
  map<int, int> hashy;
  for (int i = 0; i < n; i++) scanf("%d", &b[i]), hashy[b[i]]++;
  for (int i = 0; i < n; i++) {
    if (hashy[b[i]] > 1) {
      puts("YES");
      return;
    }
  }
  puts("NO");
}
int main() {
  int tc;
  for (scanf("%d", &tc); tc--;) solve();
}
