#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
long long binpow(long long a, long long b) {
  if (!b) return 1;
  if (b == 1) return a;
  long long q = binpow(a, b / 2);
  if (b & 1) return ((((q * q + MOD) % MOD) * a + MOD) % MOD + MOD) % MOD;
  return ((q * q + MOD) % MOD + MOD) % MOD;
}
pair<long long, long long> intersect(pair<long long, long long> a,
                                     pair<long long, long long> b) {
  return {max(a.first, b.first), min(a.second, b.second)};
}
char popcount(long long a) {
  long long r = 0;
  while (a) r += a & 1, a >>= 1;
  return r;
}
vector<string> a;
string ans;
bool ok(string s, string t) {
  long long c = 0;
  for (long long i = 0; i < s.length(); ++i) c += s[i] != t[i];
  return c < 2;
}
void rec(string s) {
  if (ans.length()) return;
  if (s.length() == a.back().length()) {
    ans = s;
    return;
  }
  for (char c = 'a'; c <= 'z'; ++c) {
    string g = s + c;
    bool o = 1;
    for (long long i = 0; i < a.size(); ++i) o &= ok(g, a[i]);
    if (o) rec(g);
  }
}
signed main() {
  cin.tie(0);
  cout.tie(0);
  ios::sync_with_stdio(0);
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    vector<long long> a(n);
    for (auto& e : a) cin >> e, e++;
    bool f = 0;
    for (long long i = 0; i < n; ++i)
      for (long long j = i + 1; j < n; ++j) f |= a[i] == a[j];
    cout << (f ? "YES" : "NO") << "\n";
  }
}
