#include <iostream>
#include <bits/stdc++.h>

#define ll long long
using namespace std;


void solve(){
    int n;
    cin >> n;

    vector<int> array(n, 0);
    for (int i = 0; i < n; ++i) cin >> array[i];

    vector sorted = array;
    std::sort(sorted.begin(), sorted.end());

    for (int i = 0; i < n; ++i) {
        auto position = std::find(sorted.begin(), sorted.end(), array[i]);
        int left = position - sorted.begin();
        int right = n - left - 1;

        int left_i = 0;
        int right_i = n - 1;

        while (true) {
            if (left + right + 1 < 3) {
                cout << "NO" << endl;
                break;
            }

            if (left == right) {
                cout << "YES" << endl;
                break;
            }

            if (left_i == i) {
                if (array[right_i] < array[i]) left--;
                else right--;
                right_i--;
                continue;
            }

            if (right_i == i) {
                if (array[left_i] < array[i]) left--;
                else right--;
                left_i++;
                continue;
            }

            if (left > right) {
                if (array[left_i] < array[i]) {
                    left_i++;
                    left--;
                }
                else {
                    if (array[right_i] < array[i]) left--;
                    else right--;
                    right_i--;
                }
            }
            else {
                if (array[left_i] > array[i]) {
                    left_i++;
                    right--;
                }
                else {
                    if (array[right_i] > array[i]) right--;
                    else left--;
                    right_i--;
                }
            }
        }
    }
}


int main() {
    solve();
    return 0;
}