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

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); i--)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;
/**
 * Description: $n = am + b, \frac{n}{m} = a, n \% m = b$.
 * use \_\_gcd instead of gcd.\\
 */
LL closest(LL u, LL d)
{
	if(d < 0)
		return closest(-u, -d);
	if(u < 0)
		return -closest(-u, d);
	return (2 * u + d) / (2 * d);
}
struct num : complex<LL>
{	
	num(LL a, LL b = 0) : complex(a, b) {}
	num(complex a) : complex(a) {}
	num operator/ (num x)
	{
		num prod = *this * conj(x);
		LL D = (x * conj(x)).real();
		
		LL m = closest(prod.real(), D);
		LL n = closest(prod.imag(), D);
	
		return num(m, n);
	}
	num operator% (num x)
	{
		return *this - x * (*this / x);
	}
	bool operator == (num b)
	{
		FOR(it, 0, 4)
		{
			if(real() == b.real() && imag() == b.imag())
				return true;
			b = b * num(0, 1);
		}
		return false;
	}
	bool operator != (num b)
	{
		return !(*this == b);
	}
};



//a + bi = I * (c + di) + J * (-d + ci)
//a = Ic - Jd
//b = Id + Jc
//ac = Ic^2 - Jcd
//bd = Id^2 + Jcd
//ac + bd = I * (c ^ 2 + d^2)

//(I, J) = (a + bi) / (c + di)




int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	cout << fixed << setprecision(15);
	
	int n;
	cin >> n;
	vector<num> a(n, 0);
	num g = 0;
	FOR(i, 0, n)
	{
		int A, B;
		cin >> A >> B;
		a[i] = num(A, B);
		if(i != 0)
		{
			a[i] -= a[0];
			g = __gcd(g, a[i]);
		}
	}
	vector<int> Is(n), Js(n);
	FOR(i, 1, n)
	{
		auto res = a[i] / g;
		Is[i] = res.real();
		Js[i] = res.imag();
	}
		
	sort(ALL(Is));
	sort(ALL(Js));
	
	LL k = max(Is.back() - Is[0] + 1, Js.back() - Js[0] + 1);
	cout << k * k - n << "\n";
	
	return 0;
}