import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

class BinaryIndexedTree():
    def __init__(self, seq):
        self.size = len(seq)
        self.depth = self.size.bit_length()
        self.build(seq)

    def build(self, seq):
        data = seq
        size = self.size
        for i, x in enumerate(data):
            j = i + (i & (-i))
            if j < size:
                data[j] += data[i]
        self.data = data

    def __repr__(self):
        return self.data.__repr__()

    def get_sum(self, i):
        data = self.data
        s = 0
        while i:
            s += data[i]
            i -= i & -i
        return s

    def add(self, i, x):
        data = self.data
        size = self.size
        while i < size:
            data[i] += x
            i += i & -i

    def find_kth_element(self, k):
        data = self.data
        size = self.size
        x, sx = 0, 0
        dx = 1 << (self.depth)
        for i in range(self.depth - 1, -1, -1):
            dx = (1 << i)
            if x + dx >= size:
                continue
            y = x + dx
            sy = sx + data[y]
            if sy < k:
                x, sx = y, sy
        return x + 1

N = int(readline())
m = map(int, read().split())
X1, Y1, X2, Y2 = zip(*zip(m, m, m, m))

def solve(X, Y):
    U = 20000 + 10
    bit = BinaryIndexedTree([0] * U)
    H = [0] * U
    INF = 10**9
    H[0] = INF
    for x, y in zip(X, Y):
        pts = bit.get_sum(U - 1)
        n = bit.get_sum(x - 1)
        if n == pts:
            base = 0
        else:
            base = H[bit.find_kth_element(n + 1)]
        if y <= base:
            yield 0
            continue
        if not H[x]:
            bit.add(x, 1)
        H[x] = y
        now_x = x
        area = 0
        while True:
            prev_x = bit.find_kth_element(n) if n > 0 else 0
            area += (now_x - prev_x) * (y - base)
            now_x = prev_x
            base = H[now_x]
            if base > y:
                break
            H[now_x] = 0
            bit.add(now_x, -1)
            n -= 1
        yield area

X1 = [-x for x in X1]
Y1 = [-x for x in Y1]

answer = [0] * N
for i, x in enumerate(solve(X1, Y1)):
    answer[i] += x
for i, x in enumerate(solve(X1, Y2)):
    answer[i] += x
for i, x in enumerate(solve(X2, Y1)):
    answer[i] += x
for i, x in enumerate(solve(X2, Y2)):
    answer[i] += x

print('\n'.join(map(str, answer)))