#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const long double eps = 1E-14;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

/////////////////////////////////////
void dft(vector<complex<double>>& f, bool inv) {
	ll d = f.size();
	if (d == 1) { return; }

	vector<complex<double>> ga, gb;

	rep(i, d / 2) {
		ga.push_back(f[2 * i]);
		gb.push_back(f[2 * i + 1]);
	}

	dft(ga, inv);
	dft(gb, inv);

	complex<double> now, zeta;
	now = 1;
	if (inv) { zeta = polar(1.0, 2.0 * acos(-1) / (double)d); }
	else { zeta = polar(1.0, -2.0 * acos(-1) / (double)d); }

	rep(i, d) {
		f[i] = ga[i % (d / 2)] + now * gb[i % (d / 2)];
		now *= zeta;
	}
}

template<typename T>
vector<double> multiply(vector<T> f, vector<T> g) {
	vector<complex<double>> nf, ng;
	ll sz = 1;
	while (sz < f.size() + g.size())sz *= 2;
	nf.assign(sz, 0); ng.assign(sz, 0);

	rep(i, f.size()) { nf[i] = f[i]; }
	rep(i, g.size()) { ng[i] = g[i]; }

	dft(nf, 1);
	dft(ng, 1);
	rep(i, sz)nf[i] *= ng[i];
	dft(nf, 0);
	vector<double> res;
	rep(i, sz)res.push_back(nf[i].real() / (double)sz);
	return res;
}

int main() {
	ll P = 200003;
	vll see(P, 0);

	ll r = 2;
	/*
	repn(i, P-1) {
		cout << i << endl;
		if (see[i] == 1) { continue; }
		see[i] = 1;
		ll j = i * i % P;
		ll count = 2;
		while (j != 1) {
			see[j] = 1;
			j = j * i % P;
			count ++;
		}

		if (count == P - 1) { r = i; break; }
	}
	*/

	//cout << r << endl;
	//return 0;
	//cout << endl;

	ll N;
	cin >> N;
	vll A(N + 1);
	repn(i, N)cin >> A[i];
	vll count(P, 0);
	repn(i, N)count[A[i]]++;

	vector<ll> f(P-1);
	ll c = 1;
	rep(i, P - 1) {
		f[i] = count[c];
		c = c * r % P;
		//cout << c << endl;
		//cout << i <<" "<<f[i] << endl;
	}

	vector<double> g = multiply(f, f);

	ll ans = 0;

	c = 1;
	rep(i, g.size()) {
		ll x = g[i] + 0.5;
		//cout << i << " " << x << endl;
		ans += c * x;
		c = c * r % P;
	}

	//cout << ans << endl;

	repn(i, N) {
		ans -= A[i] * A[i] % P;
	}
	ans /= 2;

	cout << ans << endl;

}


Measured memory_bytes: 45860