One day *n* friends met at a party, they hadn't seen each other for a long time and so they decided to make a group photo together. 

Simply speaking, the process of taking photos can be described as follows. On the photo, each photographed friend occupies a rectangle of pixels: the *i*-th of them occupies the rectangle of width *w*<sub class="lower-index">*i*</sub> pixels and height *h*<sub class="lower-index">*i*</sub> pixels. On the group photo everybody stands in a line, thus the minimum pixel size of the photo including all the photographed friends, is *W* × *H*, where *W* is the total sum of all widths and *H* is the maximum height of all the photographed friends.

As is usually the case, the friends made *n* photos — the *j*-th (1 ≤ *j* ≤ *n*) photo had everybody except for the *j*-th friend as he was the photographer.

Print the minimum size of each made photo in pixels.
The first line contains integer *n* (2 ≤ *n* ≤ 200 000) — the number of friends. 

Then *n* lines follow: the *i*-th line contains information about the *i*-th friend. The line contains a pair of integers *w*<sub class="lower-index">*i*</sub>, *h*<sub class="lower-index">*i*</sub> (1 ≤ *w*<sub class="lower-index">*i*</sub> ≤ 10, 1 ≤ *h*<sub class="lower-index">*i*</sub> ≤ 1000) — the width and height in pixels of the corresponding rectangle.
totalW =0
maximum = 0
nextToMax = 0

d = { 0 : [0, 0, 0] }

w=[]
h=[]
for item in range(int(input())):
    currentW, currentH = map(int, input().split())
    w.append(currentW)
    h.append(currentH)

    totalW+=currentW

    if currentH > d[0][0]:
        temp = [currentH, 1, 0 ]#currentH - d[0][2]]
        d[0] = temp
    elif currentH == d[0]:
        d[0][1] = d[0][1] + 1

    elif currentH - d[0][2] > d[0][2]:
        d[0][2] = currentH - d[0][2]

result=[]
for i,item in enumerate(w):
    if d[0][1] >= 2 or h[i] != d[0][0]:
        h_mult = d[0][0]
    else:
        h_mult = d[0][0] - d[0][2]
    result.append(str((totalW - item) * h_mult))

print(" ".join(result))

