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.
def f1(dp,hh,a,n):
    for i in range (1,n+1):
        dp[i]=dp[0]-a[i-1][0]*hh
    print(*(dp[1:]))
def f2(dp,h,a,n,dd):
    for i in range (1,n+1):
        if a[i-1][1]!=h[0]:
            dp[i]=dp[0]-a[i-1][0]*h[0]
        else:
            dp[i]=dd-a[i-1][0]*h[1]
    print(*(dp[1:]))
n=int(input())
a=[]
dp=[0 for _ in range (n+1)]
h=[0 for __ in range (n)]
for _ in range (n):
    a.append(list(map(int,input().split())))
    dp[0]+=a[_][0]
    h[_]=a[_][1]
k=False
h.sort(reverse=1)
#print(h)
if h[0]==h[1]:
    k=True
dd=dp[0]
dp[0]*=h[0]
if k==True:
    f1(dp,h[0],a,n)
    #print(1)
else:
    f2(dp,h,a,n,dd*h[1])