#include<bits/stdc++.h>

using namespace std;

int n,a[];

int main()

{

    ios::sync_with_stdio();

    cin >> n;

    for(int i = ;i <= *n;i++) cin >> a[i];

    sort(a+,a++n*);

    reverse(a+,a++n*);

    if(a[n] > a[n+])   cout << "YES" << endl;

    else    cout << "NO" << endl;

    return ;

}

#include<bits/stdc++.h>

using namespace std;

int n,sub[],add[];

string s;

int main()

{

    ios::sync_with_stdio();

    cin >> s;

    int sum1 = ,sum2 = ;

    for(int i = ;i < ;i++)

    {

        sum1 += s[i]-'';

        sub[i] = s[i]-'';

        add[i] = ''-s[i];

    }

    for(int i = ;i < ;i++)

    {

        sum2 += s[i]-'';

        sub[i] = s[i]-'';

        add[i] = ''-s[i];

    }

    if(sum1 > sum2)

    {

        int t = sum1-sum2;

        int a[];

        for(int i = ;i < ;i++)    a[i] = sub[i];

        for(int i = ;i < ;i++)    a[i] = add[i];

        sort(a,a+);

        reverse(a,a+);

        for(int i = ;i < ;i++)

        {

            t -= a[i];

            if(t <= )

            {

                cout << i+ << endl;

                return ;

            }

        }

    }

    else if(sum2 > sum1)

    {

        int t = sum2-sum1;

        int a[];

        for(int i = ;i < ;i++)    a[i] = add[i];

        for(int i = ;i < ;i++)    a[i] = sub[i];

        sort(a,a+);

        reverse(a,a+);

        for(int i = ;i < ;i++)

        {

            t -= a[i];

            if(t <= )

            {

                cout << i+ << endl;

                return ;

            }

        }

    }

    else    cout <<  << endl;

    return ;

}

#include<bits/stdc++.h>

using namespace std;

int n;

struct xx

{

    int l,r;

    friend bool operator<(xx a,xx b)

    {

        return a.l < b.l;

    }

}a[];

int main()

{

    ios::sync_with_stdio();

    cin >> n;

    for(int i = ;i <= n;i++)   cin >> a[i].l >> a[i].r;

    sort(a+,a++n);

    int ans = ;

    priority_queue< int,vector<int>,greater<int> > q;

    for(int i = ;i <= n;i++)

    {

        if(q.empty() || a[i].l <= q.top())

        {

            ans++;

            q.push(a[i].r);

        }

        else

        {

            q.pop();

            q.push(a[i].r);

        }

    }

    if(ans > ) cout << "NO" << endl;

    else    cout << "YES" << endl;

    return ;

}

#include<bits/stdc++.h>

using namespace std;

int n;

int main()

{

    ios::sync_with_stdio();

    cin >> n;

    stack<int> s;

    int ans = ,now,cntover = ;

    while(n--)

    {

        int x,y;

        cin >> x;

        if(x == )  cin >> now;

        else if(x == )

        {

            ans += cntover;

            cntover = ;

        }

        else if(x == )

        {

            cin >> y;

            s.push(y);

        }

        else if(x == ) cntover = ;

        else if(x == )

        {

            while(!s.empty())   s.pop();

        }

        else    cntover++;

        while(!s.empty() && now > s.top())

        {

            ans++;

            s.pop();

        }

    }

    cout << ans << endl;

    return ;

}

#include<bits/stdc++.h>

using namespace std;

int n,m,a[],vis[] = {};

struct xx

{

    int to,w;

    xx(int a,int b):to(a),w(b){};

};

vector<xx> v[];

vector<int> vv;

void add(int x)

{

    for(int i = ;i < vv.size();i++)    x = min(x,x^vv[i]);

    if(x)   vv.push_back(x);

}

void dfs(int now,int val)

{

    vis[now] = ;

    a[now] = val;

    for(int i = ;i < v[now].size();i++)

    {

        int t = v[now][i].to,w = v[now][i].w;

        if(vis[t])  add(val^w^a[t]);

        else    dfs(t,w^val);

    }

}

int main()

{

    ios::sync_with_stdio();

    cin >> n >> m;

    while(m--)

    {

        int x,y,z;

        cin >> x >> y >> z;

        v[x].push_back(xx(y,z));

        v[y].push_back(xx(x,z));

    }

    dfs(,);

    for(int i = ;i < vv.size();i++)    a[n] = min(a[n],a[n]^vv[i]);

    cout << a[n] << endl;

    return ;

}