#include<bits/stdc++.h> 
#define ll long long 
#define LL __int128_t 
#define PB push_back 
#define debug(x) cout<<#x<<" "<<x<<endl 
using namespace std;
const int N(100005);
const double EPS=1e-9;
inline int sgn(double a){ return a < -EPS ? -1 : a > EPS; }
inline int cmp(double a, double b){ return sgn(a-b); }
struct Point;
typedef Point Vector;
struct Point{
    double x,y;
    Point(){}
    Point(double a, double b):x(a),y(b){}
    double len(){return sqrt(x*x+y*y);}
    bool onSegment(Point s, Point e);
    int inPolygon(Point poly[]);
    void read() { cin>>x>>y; }
    void out() {cout<<"x: "<<x<<" y: "<<y<<endl;}
    Point operator+(Vector v) {return {x+v.x,y+v.y};}
    Vector operator-(Point p) {return {x-p.x,y-p.y};}
    double operator^(Vector v) {return x*v.y-y*v.x;}//叉乘
    double operator*(Vector v) {return x*v.x+y*v.y;}//点乘
}poly[N];
bool Point::onSegment(Point s, Point e){
	Vector v1 = s-*this;
	Vector v2 = e-*this;
	return sgn(v1^v2)==0&&sgn(v1*v2)<=0;
}
bool onLine(Point x, Point s, Point e){
	Vector v1 = s-x;
	Vector v2 = e-x;
	return sgn(v1^v2)==0;
}
int n;
int Point::inPolygon(Point poly[])
{//判断点是否在多边形内，若点在多边形内返回1，在多边形外部返回0，在多边形上返回-1
    int wn = 0;
    for(int i = 1; i <= n; ++i){
        if((*this).onSegment(poly[i], poly[i%n+1])) return -1;
        int k = sgn((poly[i%n+1] - poly[i])^(*this - poly[i]));
        int d1 = sgn(poly[i].y - y);
        int d2 = sgn(poly[i%n+1].y - y);
        if(k > 0 && d1 <= 0 && d2 > 0) wn++;
        if(k < 0 && d2 <= 0 && d1 > 0) wn++;
    }
    return wn%2;
}
int L[2], p;
int main() 
{ 
	//freopen("1.in","r",stdin); 
	ios::sync_with_stdio(false); 
	cin.tie(NULL);
	cin >> n;
	for(int i = 1; i <= n; ++i) poly[i].read();
	Point ant, line; ant.read(), line.read();
	for(int i = 1; i <= n; ++i)
		if(ant.onSegment(poly[i], poly[i%n+1]))
		{
			Point cp = ant;
			ant.x = (poly[i].x+poly[i%n+1].x)/2;
			ant.y = (poly[i].y+poly[i%n+1].y)/2;
			if(onLine(line, poly[i], poly[i%n+1])) { cout<<"?"<<endl; return 0; }
			Point dec = poly[i%n+1]-poly[i];
			double adx, ady;
			if(!sgn(dec.y)) adx = 0, ady = 1;
			else adx = dec.y, ady = -dec.x;
			Point bsx(ant.x+adx, ant.y+ady);
			Vector base = bsx-ant;
			if(base*(line-ant) < 0) bsx.x -= adx*2, bsx.y -= ady*2, base = bsx-ant;
			for(int j = 1; j <= n; ++j) if(j != i)
			{
				Vector JGbase = ant-poly[j];
				Vector v1 = bsx-poly[j];
				Vector v2 = poly[j%n+1]-poly[j];
				if(sgn(JGbase^v1) != sgn(JGbase^v2) && sgn(JGbase^v2) != 0 && sgn(JGbase^v1)) continue;
				Vector v3 = poly[j] - ant;
				Vector v4 = poly[j%n+1] - ant;
				int d1 = sgn(base^v3);
				int d2 = sgn(base^v4);
				if(d1 >= 0 && d2 < 0) L[p]++;
				else if(d2 >= 0 && d1 < 0) L[p]++;
			}
			ant = cp;
			p++;
		}
	if(p == 2 && (L[0]%2)^(L[1]%2)) cout<<"?"<<endl;
	else if(L[0]%2) cout<<"inside"<<endl;
	else if(!L[0]%2) cout<<"outside"<<endl;
	return 0; 
}