#include <iostream> #include <vector> #include <algorithm> using namespace std; void solve() { int n; cin >> n; vector<int> cnt(n + 1, 0); int max_cnt = 0; for (int i = 0; i < n; ++i) { int a; cin >> a; cnt[a]++; max_cnt = max(max_cnt, cnt[a]); } if (max_cnt > (n + 1) / 2) cout << "N\n"; else cout << "Y\n"; } int main() { int k; cin >> k; while (k--) solve(); return 0; }