#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int MAX_N = 200000 + 5;

int N;
struct Point{
    int x, y;
    Point(int a = 0, int b = 0) : x(a), y(b) {}
    inline bool operator < (const Point &comp) const {return x < comp.x || x == comp.x && y < comp.y;}
}p[4][MAX_N];
typedef vector <Point> vp;

vp calc_convex_hull(Point *p) {
    vp res(0);
    sort(p + 1, p + N + 1);
    static int sta[MAX_N];
    int top = 0;
    for (int i = 1; i <= N; i ++) {
        // fprintf(stderr, "i = %d, x = %d, y = %d, top = %d\n", i, p[i].x, p[i].y, top);
        while (top > 1 && 1ll * (p[i].y - p[sta[top]].y) * (p[i].x - p[sta[top - 1]].x) >= 1ll * (p[i].x - p[sta[top]].x) * (p[i].y - p[sta[top - 1]].y)) top --;
        sta[++ top] = i;
    }
    // fprintf(stderr, "top = %d\n", top);
    for (int i = 1; i <= top; i ++) res.push_back(p[sta[i]]);
    top = 0;
    for (int i = N; i > 0; i --) {
        while (top > 1 && 1ll * (p[i].y - p[sta[top]].y) * (p[i].x - p[sta[top - 1]].x) >= 1ll * (p[i].x - p[sta[top]].x) * (p[i].y - p[sta[top - 1]].y)) top --;
        sta[++ top] = i;
    }
    for (int i = 2; i < top; i ++) res.push_back(p[sta[i]]);
    return res;
}

bool check(Point *p1, Point *p2) {
    vp ch1 = calc_convex_hull(p1), ch2 = calc_convex_hull(p2);
    vp sv1 = ch2, sv2 = ch1;
    // fprintf(stderr, "ch1 :\n");
    // for (auto [x, y] : ch1) fprintf(stderr, "x = %d, y = %d\n", x, y);
    // fprintf(stderr, "ch2 :\n");
    // for (auto [x, y] : ch2) fprintf(stderr, "x = %d, y = %d\n", x, y);
    // fprintf(stderr, "\n");
    sort(ch1.begin(), ch1.end());
    ch2.push_back(*ch2.begin());
    for (int i = 0, j = ch2.size() - 1, k = 0; i < j && k < ch1.size(); k ++) {
        while (i < j && ch2[i].x <= ch2[i + 1].x && ch2[i + 1].x < ch1[k].x) i ++;
        while (i < j && ch2[j].x <= ch2[j - 1].x && ch2[j - 1].x < ch1[k].x) j --;
        if (i == j) break;
        if (ch2[i].x > ch1[k].x) continue;
        if ((ll)(ch2[i + 1].y - ch2[i].y) * (ch1[k].x - ch2[i].x) + (ll)ch2[i].y * (ch2[i + 1].x - ch2[i].x) <= (ll)ch1[k].y * (ch2[i + 1].x - ch2[i].x)) continue;
        if ((ll)ch2[j].y * (ch2[j - 1].x - ch2[j].x) + (ll)(ch2[j - 1].y - ch2[j].y) * (ch1[k].x - ch2[j].x) >= (ll)ch1[k].y * (ch2[j - 1].x - ch2[j].x)) continue;
        return false;
    }
    ch1 = sv1; ch2 = sv2;
    sort(ch1.begin(), ch1.end());
    ch2.push_back(*ch2.begin());
    for (int i = 0, j = ch2.size() - 1, k = 0; i < j && k < ch1.size(); k ++) {
        while (i < j && ch2[i].x <= ch2[i + 1].x && ch2[i + 1].x < ch1[k].x) i ++;
        while (i < j && ch2[j].x <= ch2[j - 1].x && ch2[j - 1].x < ch1[k].x) j --;
        if (i == j) break;
        if (ch2[i].x > ch1[k].x) continue;
        if ((ll)(ch2[i + 1].y - ch2[i].y) * (ch1[k].x - ch2[i].x) + (ll)ch2[i].y * (ch2[i + 1].x - ch2[i].x) <= (ll)ch1[k].y * (ch2[i + 1].x - ch2[i].x)) continue;
        if ((ll)ch2[j].y * (ch2[j - 1].x - ch2[j].x) + (ll)(ch2[j - 1].y - ch2[j].y) * (ch1[k].x - ch2[j].x) >= (ll)ch1[k].y * (ch2[j - 1].x - ch2[j].x)) continue;
        return false;
    }
    return true;
}

int main() {
    scanf("%d", &N);
    for (int i = 1; i <= N; i ++) {
        int x1, y1, x2, y2;
        scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
        p[0][i] = Point(x1, y1);
        p[1][i] = Point(x2, y2);
        p[2][i] = Point(x1, y2);
        p[3][i] = Point(x2, y1);
    }
    if (check(p[0], p[1]) || check(p[2], p[3])) puts("possible");
    else puts("impossible");
    return 0;
}