#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, n) for (int i=(a); i < (n); i++)
#define per(i, a, n) for (int i=(n)-1; i >= (a); i--)
#define ll long long
#define x first
#define y second
const ll INF = 2e18;
typedef pair<ll,ll> pt;

int n;

	ll m;
	
ll go(vector<pt> &v){
	ll res = INF;
	vector<pair<pt, int>> xo, yo;
	rep(i,0,n) xo.push_back({v[i], i}), yo.push_back({{v[i].y, v[i].x}, i});
	sort(xo.begin(), xo.end());
	sort(yo.begin(), yo.end());
	rep(i,0,n) swap(yo[i].x.x, yo[i].x.y);
	set<int> active;
	multiset<ll> xs, ys;
	int yi = 0;
	//for(auto a : xo) cout << a.x.x << " " << a.x.y << endl;
	//cout<<"---------"<<endl;
	rep(i,0,n){
		if(xo[i].x.y >= yo[yi].x.y) {
			active.insert(xo[i].second);
			xs.insert(xo[i].x.x);
			ys.insert(xo[i].x.y);
		}
		if(i < n-1 && xo[i+1].x.x == xo[i].x.x){
			continue;
		}
		//cout << i << ": "<<yo[yi].x.y << ": ";
		//for(auto asdf : active) cout << asdf<<" ";cout<<endl;
		while(active.size() > (n / 2)){
			while(yi<n){
				if(active.count(yo[yi].y)){
					active.erase(yo[yi].y);
					xs.erase(xs.find(yo[yi].x.x));
					ys.erase(ys.find(yo[yi].x.y));
				}
				yi++;
				if(yi==n) return res;
				if(yo[yi].x.y != yo[yi-1].x.y) break;
			}		
		}
		if(active.size() == n/2){
			//for(auto a : xs) cout << a << " "; cout << endl;
			ll cur = (*(--xs.end())+1) * (m - *(ys.begin()));
			//ll cur = (xo[i].x.x+1) * (m-yo[yi].x.y);
			//cout << "yes " << (*(--xs.end())) << " " << (*(--ys.end())) << ": " << cur << endl;
			res = min(res, cur);
		}
	}
	return res;
}

int main(void) {

	while(cin>>m>>n){
		vector<pair<ll,ll>> v(n);
		rep(i,0,n)cin>>v[i].x>>v[i].y;
		//cout<<n<< " "<<m<<"!!"<<endl;
		if(n%2) {
			cout<<-1<<endl;
			continue;
		}
		ll res = INF;
		rep(i,0,4){
			res = min(res, go(v));
			rep(j,0,n) {
				swap(v[j].x, v[j].y);
				v[j].y = m - 1 - v[j].y;
			}
		}
		if(res == INF) res = -1;
		cout << res << endl;
	}
	return 0;
}