#include <bits/stdc++.h>
 
//    #include <boost/multiprecision/cpp_int.hpp>
 #define int long long
 #define inf  1000000007
// #define inf  998244353

 #define pa pair<int,int>
 #define ll long long
 #define pal pair<double,double>
 #define ppap pair<pa,int>
  #define PI 3.14159265358979323846
  #define paa pair<int,char>
  #define  mp make_pair
  #define  pb push_back
  #define EPS (1e-8)
                                          
    int dx[8]={0,1,0,-1,1,1,-1,-1};
    int dy[8]={1,0,-1,0,-1,1,1,-1};
                                            using namespace std;
                                   			class pa3{
                                            	public:
                                            	int x;
                                   				int y,z;
                                            	pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
                                            	bool operator < (const pa3 &p) const{
                                            		if(x!=p.x) return x<p.x;
                                            		if(y!=p.y) return y<p.y;
                                            		 return z<p.z;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                   				bool operator > (const pa3 &p) const{
                                            		if(x!=p.x) return x>p.x;
                                            		if(y!=p.y) return y>p.y;
                                            		 return z>p.z;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa3 &p) const{
                                            		return x==p.x && y==p.y && z==p.z;
                                            	}
                                            		bool operator != (const pa3 &p) const{
                                            			return !( x==p.x && y==p.y && z==p.z);
                                            	}
                                            
                                            };
                                            
                                            class pa4{
                                            	public:
                                            	int x;
                                            	int y,z,w;
                                            	pa4(int x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
                                            	bool operator < (const pa4 &p) const{
                                            		if(x!=p.x) return x<p.x;
                                            		if(y!=p.y) return y<p.y;
                                            		if(z!=p.z)return z<p.z;
                                            		return w<p.w;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator > (const pa4 &p) const{
                                            		if(x!=p.x) return x>p.x;
                                            		if(y!=p.y) return y>p.y;
                                            		if(z!=p.z)return z>p.z;
                                            		return w>p.w;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa4 &p) const{
                                            		return x==p.x && y==p.y && z==p.z &&w==p.w;
                                            	}
                                            		
                                            
                                            };
                                            class pa2{
                                            	public:
                                            	int x,y;
                                            	pa2(int x=0,int y=0):x(x),y(y) {}
                                            	pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
                                            	pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
                                            	bool operator < (const pa2 &p) const{
                                            		return y != p.y ? y<p.y: x<p.x;
                                            	}
                                            	bool operator > (const pa2 &p) const{
                                            		return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa2 &p) const{
                                            		return abs(x-p.x)==0 && abs(y-p.y)==0;
                                            	}
                                            	bool operator != (const pa2 &p) const{
                                            		return !(abs(x-p.x)==0 && abs(y-p.y)==0);
                                            	}
                                            		
                                            
                                            };
                                            
 
                      
                                string itos( int i ) {
                                ostringstream s ;
                                s << i ;
                                return s.str() ;
                                }
                                 
                                int Gcd(int v,int b){
                                	if(v==0) return b;
                                	if(b==0) return v;
                                	if(v>b) return Gcd(b,v);
                                	if(v==b) return b;
                                	if(b%v==0) return v;
                                	return Gcd(v,b%v);
                                }
                 
                            
                                int mod;
int extgcd(int a, int b, int &x, int &y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    int d = extgcd(b, a%b, y, x);
    y -= a/b * x;
    return d;
}
pa operator+(const pa & l,const pa & r) {   
    return {l.first+r.first,l.second+r.second};                                    
}    
pa operator-(const pa & l,const pa & r) {   
    return {l.first-r.first,l.second-r.second};                                    
}  
                int beki(int wa,int rr,int warukazu){
                	if(rr==0) return 1%warukazu;
                	if(rr==1) return wa%warukazu;
                	wa%=warukazu;
                	if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;
                	ll zx=beki(wa,rr/2,warukazu);
                	return (zx*zx)%warukazu;
                }
 
                              
                int pr[100000];
                int inv[100000];
                

                
    			int comb(int nn,int rr){
    				if(rr<0 || rr>nn || nn<0) return 0;
    				int r=pr[nn]*inv[rr];
    				r%=mod;
    				r*=inv[nn-rr];
    				r%=mod;
    				return r;
    			}
               
                void gya(int ert){
                	pr[0]=1;
                	for(int i=1;i<=ert;i++){
                		pr[i]=((ll)pr[i-1]*i)%mod;
                	}
                		inv[ert]=beki(pr[ert],mod-2,mod);
                	for(int i=ert-1;i>=0;i--){
                		inv[i]=(ll)inv[i+1]*(i+1)%mod;
                	}
                }
                
              //   cin.tie(0);
    		//	ios::sync_with_stdio(false);
    			//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;            
                 //sort(ve.begin(),ve.end(),greater<int>());
 //   mt19937(clock_per_sec);
  //  mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) ;
class comp{
public:
double re,im;
comp(double re=0,double im=0):re(re),im(im) {};
comp operator + (comp p) {return comp(re+p.re,im+p.im);}	
comp operator - (comp p) {return comp(re-p.re,im-p.im);}
comp operator * (comp p) {return comp(re*p.re-im*p.im,re*p.im+im*p.re);}
comp operator / (double p){return comp(re/p,im/p);}
 
};
comp D[1000000];
void fourie(int N,int d,vector<comp> &vec ){// 1<<d == N
	// Uは順方向ではexp(2pi*I/N)逆だとexp(-2pi*I/N)
	if(N==1){
		return;
	}
	int gyaku=0;
	for(int i=1;i<N;i++){
		int e=1<<(d-1);
		while(gyaku&e){
			gyaku^=e;
			e>>=1;
		}
		gyaku^=e;
		if(i<gyaku)swap(vec[i],vec[gyaku]);	
	}
	for(int c=0;c<d;c++){
		int f=1<<c;
		for(int i=0;i<N;i+=(f<<1)){
			for(int j=i;j<i+f;j++){
				comp A1=vec[j]+vec[j+f]*D[(j-i)<<(d-c-1)];
				comp A2=vec[j]-vec[j+f]*D[(j-i)<<(d-c-1)];
				vec[j]=A1;
				vec[j+f]=A2;
			}
		}
	}
 
	return;
}
 
vector<int> FFT(vector<comp> input1,vector<comp> input2){
int N=1;
	int d=0;
	int size1=input1.size(),size2=input2.size();
	while(N<size1+size2){
		N*=2;
		d++;
	}
	assert(N==(1<<d));
	while(input1.size()<N)input1.pb(0);
	while(input2.size()<N)input2.pb(0);
//	complex<double> un=exp(complex<double>(0,2*PI/N));
	for(int i=0;i<N;i++){
		
		complex<double> un=exp(complex<double>(0.0,(double)2*PI*i/N));
		D[i]=(comp){un.real(),un.imag()};
	}
	fourie(N,d,input1);
	fourie(N,d,input2);
	vector<int> ANS;
	
	for(int i=0;i<N;i++)input1[i]=input1[i]*input2[i],(D[i].im)*=-1;
	
	fourie(N,d,input1);
	for(int i=0;i<N;i++)input1[i]=input1[i]/(N*1.0);
	
	for(int i=0;i<N;i++){
		ANS.pb((int) (0.5+input1[i].re));
	//	cout<<ANS.back()<<endl;
	//	printf("%.10lf\n", INV[i].real());
	}
	return ANS;
}

int a[200020]={};

void solve(){
int n;
	cin>>n;
	vector<int> ve;
	for(int i=0;i<n;i++){
		int y;
		cin>>y;
		if(y>0)ve.pb(y);
	}
	n=ve.size();
	if(n==0){
		cout<<0<<endl;
		return;
	}
	int P=200003;
	int ima=1;
	for(int i=0;i<P-1;i++){
		a[ima]=i;
		ima*=2;
		ima%=P;
	}
//	for(int i=1;i<P;i++)if(a[i]==0)cout<<i<<endl;
	
		vector<comp> W(P+10,{0,0});
	for(auto v:ve){
		W[a[v]].re+=1.0;
//		cout<<v<<" "<<a[v]<<endl;
//		cout<<beki(2,a[v],P)<<" " <<v<<endl;
	}
	vector<int> F=FFT(W,W);
	while(F.size()<P-1)F.pb(0);
	for(int i=P-1;i<F.size();i++)F[i%(P-1)]+=F[i];
	ima=1;
	int ans=0;
	for(int i=0;i<P-1;i++){
		ans+=F[i]*ima;
		ima=ima*2%P;
	}
	for(auto v:ve)ans-=(v*v)%P;
	ans/=2;
	cout<<ans<<endl;
}
signed main(){
	
	cin.tie(0);
	ios::sync_with_stdio(false);
int n=1;
	//cin>>n;
	
	
	for(int i=0;i<n;i++)solve();
	
	return 0;
 }


Measured memory_bytes: 50108