#include <algorithm>
#include <cstdio>
#include <cstring>
typedef long long ll;
//ll*1004535809ll
ll mod=998244353ll*1004535809ll,inv1,inv2;
ll mul(ll a,ll b,ll mod)
{
	ll c=a*b-(ll)((long double)a*b/mod+0.5)*mod;
	if (c<0) c+=mod;
	return c;
}
namespace Math {
	inline int pw(int base, int p, const int mod) {
		static int res;
		for (res = 1; p; p >>= 1, base = static_cast<long long> (base) * base % mod) if (p & 1) res = static_cast<long long> (res) * base % mod;
		return res;
	}
	inline int inv(int x, const int mod) { return pw(x, mod - 2, mod); }
}

const int mod1 = 998244353, mod2 = 1004535809, mod3 = 469762049, G = 3;
const long long mod_1_2 = static_cast<long long> (mod1) * mod2;
const int inv_1 = Math::inv(mod1, mod2), inv_2 = Math::inv(mod_1_2 % mod3, mod3);
struct Int {
	int A, B, C;
	explicit inline Int() { }
	explicit inline Int(int __num) : A(__num), B(__num), C(__num) { }
	explicit inline Int(int __A, int __B, int __C) : A(__A), B(__B), C(__C) { }
	static inline Int reduce(const Int &x) {
		return Int(x.A + (x.A >> 31 & mod1), x.B + (x.B >> 31 & mod2), x.C + (x.C >> 31 & mod3));
	}
	inline friend Int operator + (const Int &lhs, const Int &rhs) {
		return reduce(Int(lhs.A + rhs.A - mod1, lhs.B + rhs.B - mod2, lhs.C + rhs.C - mod3));
	}
	inline friend Int operator - (const Int &lhs, const Int &rhs) {
		return reduce(Int(lhs.A - rhs.A, lhs.B - rhs.B, lhs.C - rhs.C));
	}
	inline friend Int operator * (const Int &lhs, const Int &rhs) {
		return Int(static_cast<long long> (lhs.A) * rhs.A % mod1, static_cast<long long> (lhs.B) * rhs.B % mod2, static_cast<long long> (lhs.C) * rhs.C % mod3);
	}
	inline int get() {
		long long x = static_cast<long long> (B - A + mod2) % mod2 * inv_1 % mod2 * mod1 + A;
		return (static_cast<long long> (C - x % mod3 + mod3) % mod3 * inv_2 % mod3 * (mod_1_2 % mod) % mod + x) % mod;
	}
	inline long long get2()
	{
		long long x=mul(mul(A,inv2,mod),1004535809ll,mod);
		long long y=mul(mul(B,inv1,mod),998244353ll,mod);
		return (x+y)%mod;
	}
} ;

#define maxn 262144

namespace Poly {
#define N (maxn << 1)
	int lim, s, rev[N];
	Int Wn[N | 1];
	inline void init(int n) {
		s = -1, lim = 1; while (lim < n) lim <<= 1, ++s;
		for (register int i = 1; i < lim; ++i) rev[i] = rev[i >> 1] >> 1 | (i & 1) << s;
		const Int t(Math::pw(G, (mod1 - 1) / lim, mod1), Math::pw(G, (mod2 - 1) / lim, mod2), Math::pw(G, (mod3 - 1) / lim, mod3));
		*Wn = Int(1); for (register Int *i = Wn; i != Wn + lim; ++i) *(i + 1) = *i * t;
	}
	inline void NTT(Int *A, const int op = 1) {
		for (register int i = 1; i < lim; ++i) if (i < rev[i]) std::swap(A[i], A[rev[i]]);
		for (register int mid = 1; mid < lim; mid <<= 1) {
			const int t = lim / mid >> 1;
			for (register int i = 0; i < lim; i += mid << 1) {
				for (register int j = 0; j < mid; ++j) {
					const Int W = op ? Wn[t * j] : Wn[lim - t * j];
					const Int X = A[i + j], Y = A[i + j + mid] * W;
					A[i + j] = X + Y, A[i + j + mid] = X - Y;
				}
			}
		}
		if (!op) {
			const Int ilim(Math::inv(lim, mod1), Math::inv(lim, mod2), Math::inv(lim, mod3));
			for (register Int *i = A; i != A + lim; ++i) *i = (*i) * ilim;
		}
	}
#undef N
}
int mypow(int a,int b,int mod)
{
	int ans=1;
	while(b)
	{
		if(b&1)ans=1ll*ans*a%mod;
		a=1ll*a*a%mod;
		b>>=1;
	}
	return ans;
}
int n, m,vis[200003],x,a[200005],N;
Int A[maxn << 1], B[maxn << 1];
int pp=200003;
long long ans=0,cnt[200003];
int main() {
	inv1=mypow(998244353,1004535807,1004535809);
	inv2=mypow(1004535809%998244353,998244351,998244353);
	vis[1]=0;
	for(int i=1,g=2;i<pp-1;i++,g=g*2%pp)
	{
		vis[g]=i;
	}
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&x);
		//printf("@%d\n",vis[x]);
		x=x%pp;a[i]=x;
		if(x>0)
		{
			A[vis[x]].A++;
			A[vis[x]].B++;
			A[vis[x]].C++;
			B[vis[x]].A++;
			B[vis[x]].B++;
			B[vis[x]].C++;
		}
	}
	N=n;
	m=n=200003;
	Poly::init(n + m);
	Poly::NTT(A), Poly::NTT(B);
	for (int i = 0; i < Poly::lim; ++i) A[i] = A[i] * B[i];
	Poly::NTT(A, 0);
	for (int i = 0; i < n + m - 1; ++i) {
		cnt[i%200002]+=A[i].get2();
		//if(A[i].get2())printf("%d %lld\n",i,A[i].get2());
	}
	for(int i=1;i<pp;i++)ans=ans+i*cnt[vis[i]];
	for(int i=1;i<=N;i++)ans=ans-1ll*a[i]*a[i]%pp;
	ans=ans/2ll;
	printf("%lld\n",ans);
	return 0;
}

Measured memory_bytes: 25336