#include<cstdio>

#include<cctype>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<iostream>

using namespace std;

typedef long long ll;

typedef long double dl;

const dl pi=acos(-1.0);

const int N=3e5+;

inline int read(){

    int X=,w=;char ch=;

    while(!isdigit(ch)){w|=ch=='-';ch=getchar();}

    while(isdigit(ch))X=(X<<)+(X<<)+(ch^),ch=getchar();

    return w?-X:X;

}

struct complex{//定义复数

    dl x,y;

    complex(dl xx=0.0,dl yy=0.0){

        x=xx;y=yy;

    }

    complex operator +(const complex &b)const{

        return complex(x+b.x,y+b.y);

    }

    complex operator -(const complex &b)const{

        return complex(x-b.x,y-b.y);

    }

    complex operator *(const complex &b)const{

        return complex(x*b.x-y*b.y,x*b.y+y*b.x);

    }

};

void FFT(complex a[],int n,int on){

    for(int i=,j=n>>;i<n-;i++){

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

        int k=n>>;

        while(j>=k){j-=k;k>>=;}

        if(j<k)j+=k;

    }

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

        complex res(cos(-on**pi/i),sin(-on**pi/i));

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

            complex w(,);

            for(int k=j;k<j+i/;k++){

                complex u=a[k],t=w*a[k+i/];

                a[k]=u+t;

                a[k+i/]=u-t;

                w=w*res;

            }

        }

    }

    if(on==-)

        for(int i=;i<n;i++)a[i].x/=n;

}

int n,m;

complex a[N],b[N],c[N],d[N];

int main(){

    n=read();

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

    int w=read();m=max(m,w);

    a[w].x=;

    b[w*].x=;

    c[w*].x=;

    }

    m=m*;

    int nn=;

    while(nn<m)nn<<=;

    FFT(a,nn,);FFT(b,nn,);FFT(c,nn,);

    for(int i=;i<nn;i++){

    complex t1(1.0/2.0,);

    complex t2(3.0,);

    complex t3(2.0,);

    complex t4(1.0/6.0,);

    d[i]=d[i]+a[i];

    d[i]=d[i]+(a[i]*a[i]-b[i])*t1;

    d[i]=d[i]+(a[i]*a[i]*a[i]-t2*a[i]*b[i]+t3*c[i])*t4;

    }

    FFT(d,nn,-);

    for(int i=;i<m;i++){

    int w=d[i].x+0.5;

    if(w)printf("%d %d\n",i,w);

    }

    return ;

}