1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
// Artur Kraska, II UWr

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <cmath>
#include <list>
#include <set>
#include <map>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(typeof(coll.begin()) iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(typeof(coll.rbegin()) iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,R,PRED)            ({typeof(P) X=P,RRR=(R), PPP = P; while(PPP<RRR) {X = (PPP+(RRR-PPP)/2); if(PRED) RRR = X; else PPP = X+1;} PPP;})
#define testy()                     int _tests; scanf("%d", &_tests); FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define deb(X)                      X;

#define M 1000000007
#define INF 1000000000000000007ll

using namespace std;

int n, m, a;

struct punkt
{
    int x, y;
};
punkt tab[250007], t[250007];

long long dst(long long a, long long b)
{
    return a*a+b*b;
}

punkt przesun_do(punkt co, punkt cel)
{
    punkt best = co;
    if(co.x != cel.x)
    {
        if(co.x < cel.x)
            best.x++;
        else
            best.x--;
    }
    if(co.y != cel.y)
    {
        if(co.y < cel.y)
            best.y++;
        else
            best.y--;
    }

    return best;
}

int main()
{
    scanf("%d", &n);
    int linia = 1;
    forr(i, n)
    {
        scanf("%d %d", &tab[i].x, &tab[i].y);
        if(tab[i].y != 1)
            linia = 0;
    }

    if(linia == 0) // brut na plaszczyznie
    {
        forr(i, n)
        {
            forr(j, n)
            {
                t[j].x = tab[j].x;
                t[j].y = tab[j].y;
            }
            //cout << i << " jest chory" << endl;
            forr(j, n) // j ryczy
                if(j != i)
                {
                    //cout << " ryczy " << j << endl;
                    forr(k, n)
                    if(k != i && k != j)
                    {
                        t[k] = przesun_do(t[k], t[j]);
                        //cout << "  " << k << " idzie do " << t[k].x << ", " << t[k].y << endl;
                    }
                }
            long long res = 0;
            forr(j, n)
            {
                res += t[j].x*t[j].y;
            }
            cout << res << endl;
        }
    }
    else // na linii
    {

    }

    return 0;
}