#include <bits/stdc++.h>
using namespace std;
using ll = long long;

struct point {
    ll x, y;

    bool operator < (const point &o) const {
        return tie(x, y) < tie(o.x, o.y);
    }
    point operator - (const point &a)const{
        return {x-a.x, y-a.y};
    }
};

ll cross(point a, point b){
    return a.x * b.y - a.y * b.x;
}

int ccw(point a, point b, point c){
    auto re = cross(b-a, c-a);
    return (re > 0) - (re < 0);
}

bool solve(vector<array<point, 2>> p) {
    vector<point> X, Y, dh, uh;
    for(auto [x, y] : p) X.push_back(x), Y.push_back(y);


    swap(*min_element(X.begin(), X.end()), X[0]);
    sort(X.begin()+1, X.end(), [&](auto a, auto b){
        auto re = ccw(X[0], a, b);
        return re ? re > 0 : tie(a.x, b.y) < tie(b.x, a.y);
    });
    reverse(X.begin()+1, X.end());

    for(auto p : X) {
        // cout << p.x << " " << p.y << "\n";
        while(dh.size() > 1 && ccw(dh[dh.size()-2], dh.back(), p) >= 0) dh.pop_back();
        dh.push_back(p);
    }



    swap(*min_element(Y.begin(), Y.end(), [&](auto a, auto b){ return tie(a.x, b.y) < tie(b.x, a.y); }), Y[0]);
    sort(Y.begin()+1, Y.end(), [&](auto a, auto b){
        auto re = ccw(Y[0], a, b);
        return re ? re > 0 : tie(a.x, b.y) < tie(b.x, a.y);
    });

    for(auto p : Y) {
        // cout << p.x << " " << p.y << "\n";
        while(uh.size() > 1 && ccw(uh[uh.size()-2], uh.back(), p) <= 0) uh.pop_back();
        uh.push_back(p);
    }

    // for(int i=0;i+1<dh.size();i++) cout << dh[i].x << " " << dh[i].y << " " << dh[i+1].x << " " << dh[i+1].y << "\n";
    // cout << "----------------------------------\n";
    // for(int i=0;i+1<uh.size();i++) cout << uh[i].x << " " << uh[i].y << " " << uh[i+1].x << " " << uh[i+1].y << "\n";
    // cout << "\n";


    for(int i=0, j=0;i+1<dh.size();i++) {
        while(j < uh.size() && uh[j].x <= dh[i+1].x) {
            if(ccw(dh[i], dh[i+1], uh[j]) < 0) return false;
            j++;
        }
    }

    for(int i=0, j=0;i+1<uh.size();i++) {
        while(j < dh.size() && dh[j].x <= uh[i+1].x) {
            if(ccw(uh[i], uh[i+1], dh[j]) > 0) return false;
            j++;
        }
    }

    return true;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n; cin >> n;

    vector<array<point, 2>> p(n);
    for(auto &[p1, p2] : p) {
        cin >> p1.x >> p1.y;
        cin >> p2.x >> p2.y;
    }
    if(solve(p)) return cout << "possible", 0;

    for(auto &[p1, p2] : p) swap(p1.x, p2.x);
    cout << (solve(p) ? "possible" : "impossible");
}