CodeForces

#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <string>#include <cmath>#include <set>#include <map>#include <stack>#include <queue>#include <ctype.h>#include <vector>#include <algorithm>#include <sstream>#define PI acos(-1.0)#define in freopen("in.txt", "r", stdin)#define out freopen("out.txt", "w", stdout)using namespace std;typedef long long ll;const int maxn = 200 + 7, INF = 0x3f3f3f3f, mod = 1e9 + 7;int n;set<int> st;map<int, int> mp;int main() {    scanf("%d", &n);    for(int i = 0; i < n; ++i) {        int x;        scanf("%d", &x);        st.insert(x);        mp[x]++;    }    if(st.size() != 2) { puts("NO"); return 0; }    for(set<int>::iterator it = st.begin(); it != st.end(); ++it) {        if(mp[*it] != n/2) { puts("NO"); return 0; }    }    puts("YES");    set<int>::iterator it = st.begin(); printf("%d ", *it); ++it;    printf("%d\n", *it);    return 0;}