#include<cstdio>#include<iostream>#include<cmath>#include<cstring>using namespace std;#define maxN 50005typedef long long ll;struct Point { int x, y;} p[maxN];struct Line { int h; int x1, x2;} l[maxN];ll lowx, lowy, k, ans1, ans2;int n, m;void add(ll x, ll y, ll c) { x -= lowx; y -= lowy; if(x % 2 == 0 || y % 2 == 0) { ans1 += c * ((ll)x * (ll)y / 2); ans2 += c * ((ll)x * (ll)y / 2); } else { ans1 += c * ((ll)x * (ll)y / 2 + k); ans2 += c * ((ll)x * (ll)y / 2 + 1 - k); }}int main(){ while(scanf("%d", &n) == 1) { scanf("%d%d", &p[0].x, &p[0].y); lowx = p[0].x; lowy = p[0].y; m = 0; for(int i=1; i<=n; i++) { if(i == n) { p[i].x = p[0].x; p[i].y = p[0].y; } else scanf("%d%d", &p[i].x, &p[i].y); if(p[i].x < lowx) lowx = p[i].x; if(p[i].y < lowy) lowy = p[i].y; if(p[i].y == p[i-1].y) { l[m].x1 = p[i-1].x; l[m].x2 = p[i].x; l[m++].h = p[i].y; } } k = ((lowx + lowy) % 2 == 0) ? 1 : 0; for(int i=0; i<m; i++) { } ans1 = ans2 = 0; for(int i=0; i<m; i++) { add((ll)l[i].x1, (ll)l[i].h, 1); add((ll)l[i].x2, (ll)l[i].h, -1); } if(ans1 < 0) ans1 = -ans1; if(ans2 < 0) ans2 = -ans2; cout << ans1 << ' ' << ans2 << endl; } return 0;}
