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.
friends_w = []
friends_h = []
max_h = 0
max_h_2 = 0
total_w = 0

amount = int(input())
for i in range(amount):
    w, h = map(int, input().split())
    friends_w.append(w)
    friends_h.append(h)
    if max_h_2 < h:
        if max_h < h:
            max_h_2 = max_h
            max_h = h
        else:
            max_h_2 = h
    total_w += w

# print(max_h, max_h_2)
for i in range(amount):
    if friends_h[i] == max_h:
        print(max_h_2 * (total_w - friends_w[i]))
    else:
        print(max_h * (total_w - friends_w[i]))
