#include<cmath>

#include<cstdio>

#include<iostream>

#include<algorithm>

using namespace std;

const int N=(<<)+;

const double pi=acos(-);

int r[N];

struct Complex

{

    double a,b;

    Complex(double x_=,double y_=):a(x_),b(y_) {}

    Complex operator + (Complex p)

    {

        Complex c;

        c.a=a+p.a;

        c.b=b+p.b;

        return c;

    }

    Complex operator - (Complex p)

    {

        Complex c;

        c.a=a-p.a;

        c.b=b-p.b;

        return c;

    }

    Complex operator * (Complex p)

    {

        Complex c;

        c.a=a*p.a-b*p.b;

        c.b=a*p.b+b*p.a;

        return c;

    }

};

typedef Complex E;

E A[N],B[N],C[N];

int n;

void read(int &x)

{

    x=; char c=getchar();

    while(!isdigit(c)) c=getchar();

    while(isdigit(c)) { x=x*+c-''; c=getchar(); }

}

void fft(E *a,int f)

{

    for(int i=;i<n;++i)

        if(i<r[i]) swap(a[i],a[r[i]]);

    for(int i=;i<n;i<<=)

    {

        E wn(cos(pi/i),f*sin(pi/i));

        for(int p=i<<,j=;j<n;j+=p)

        {

            E w(,);

            for(int k=;k<i;++k,w=w*wn)

            {

                E x=a[j+k],y=w*a[j+k+i];

                a[j+k]=x+y; a[j+k+i]=x-y;

            }

        }

    }

}

int main()

{

    int cnt;

    read(cnt);

    int x,y;

    for(int i=;i<cnt;++i)

    {

        read(x); read(y);

        A[cnt--i].a=x;

        B[i].a=y;

    }

    int m=cnt+cnt-,l=;

    for(n=;n<=m;n<<=) l++;

    for(int i=;i<n;++i) r[i]=(r[i>>]>>)|((i&)<<l-);

    fft(A,);

    fft(B,);

    for(int i=;i<n;++i) C[i]=A[i]*B[i];

    fft(C,-);

    for(int i=cnt-;i>=;--i) printf("%d\n",int(C[i].a/n+0.5));

}