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

typedef long long ll;
const ll INF=1e18;
typedef long long db;

struct point{
	db x,y;
	point operator + (const point &k1){return (point){x+k1.x,y+k1.y};}
	point operator - (const point &k1){return (point){x-k1.x,y-k1.y};}
	point operator * (db k1){return (point){x*k1,y*k1};}
	point operator / (db k1){return (point){x/k1,y/k1};}
};
db cross(point k1,point k2){return k1.x*k2.y-k1.y*k2.x;}
db dot(point k1,point k2){return k1.x*k2.x+k1.y*k2.y;}

point getLL(point k1,point k2,point k3,point k4){
	db w1=cross(k1-k3,k4-k3);
	db w2=cross(k4-k3,k2-k3);
	return (k1*w2+k2*w1)/(w1+w2);	
}

int n;
point a[100];
//const ll lim=4'000'000;
const ll lim=10;

int main(){
	ios_base::sync_with_stdio(false);
	cin >> n;
	for (int i=0;i<n;i++) cin >> a[i].x >> a[i].y;
	for (int i=0;i<n;i++){
		point P=a[(i+n-1)%n];
		point Q=a[i];
		point R=a[(i+1)%n];
		point S=a[(i+2)%n];
		if (cross(Q-P,S-R)<=0){
			cout << "infinitely many" << "\n";
			return 0;
		}
	}
	ll ans=0;
	for (int i=0;i<n;i++){
		point P=a[(i+n-1)%n];
		point Q=a[i];
		point R=a[(i+1)%n];
		point S=a[(i+2)%n];
		
		point X=getLL(P,Q,R,S);
		ll mnx=Q.x-lim;
		ll mxx=Q.x+lim;
		mnx=min(mnx,R.x-lim);
		mxx=max(mxx,R.x+lim);
		mnx=min(mnx,X.x-lim);
		mxx=max(mxx,X.x+lim);
	//	cerr << "i : " << i << endl;
		for (ll x=mnx;x<=mxx;x++){
			vector<ll> candy;
			auto gao = [&](const point &A,const point &B,ll px){
				if (A.x==B.x) return;
				else{
					ll w1=B.x-px;
					ll w2=px-A.x;
					ll fz=w1*A.y+w2*B.y;
					ll fm=w1+w2;
					if (fm<0) fz=-fz,fm=-fm;
					if (fz%fm==0){
						candy.push_back(fz/fm-1);
						candy.push_back(fz/fm+1);
					}
					else{
						if (fz>0){
							candy.push_back(fz/fm);
							candy.push_back(fz/fm+1);	
						}
						else{
							candy.push_back(fz/fm-1);
							candy.push_back(fz/fm);	
						}
					}
				}
			};
			gao(P,Q,x);
			gao(Q,R,x);
			gao(R,S,x);
			ll yl=INF;
			ll yr=-INF;
			for (auto y:candy){
				point T={x,y};
				if (cross(Q-P,T-P)<=0) continue;
				if (cross(R-Q,T-Q)>=0) continue;
				if (cross(S-R,T-R)<=0) continue;
				yl=min(yl,y);
				yr=max(yr,y);
			}
			ll now=max(yr-yl+1,0LL);
			ans=ans+now;
		}
	}
	cout << ans << "\n";
	return 0;
}