#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; }
#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} }
#define pb push_back
#define fi first
#define se second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void chOut(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using v_bool = vector<bool>;
using v_Pii = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

 //N=2^n
class FFT
{
    using comp = complex<double>;
private:
    vector<comp> f, f_tmp;

    void forward_exec(int l, int r, int t){
        if(t == n) return;
        int sz = (r - l) >> 1;
        REP(i, sz){
            f_tmp[l + i] = f[l + 2 * i];
            f_tmp[l + sz + i] = f[l + 2 * i + 1];
        }
        FOR(i, l, r) f[i] = f_tmp[i];
        forward_exec(l, l + sz, t + 1);
        forward_exec(l + sz, r, t + 1);

        REP(i, sz) f_tmp[l + i] = f[l + i] + f[l + sz + i] * pow_e[i << t];
        REP(i, sz) f_tmp[l + sz + i] = f[l + i] + f[l + sz + i] * pow_e[(sz + i) << t];
        FOR(i, l, r) f[i] = f_tmp[i];
    }

    void inverse_exec(int l, int r, int t){
        if(t == n) return;
        int sz = (r - l) / 2;
        REP(i, sz){
            f_tmp[l + i] = f[l + 2 * i];
            f_tmp[l + sz + i] = f[l + 2 * i + 1];
        }
        FOR(i, l, r) f[i] = f_tmp[i];
        inverse_exec(l, l + sz, t + 1);
        inverse_exec(l + sz, r, t + 1);

        REP(i, sz) f_tmp[l + i] = f[l + i] + f[l + sz + i] * pow_e[N - (i << t)];
        REP(i, sz) f_tmp[l + sz + i] = f[l + i] + f[l + sz + i] * pow_e[N - ((sz + i) << t)];
        FOR(i, l, r) f[i] = f_tmp[i];
    }

public:

    int N, n;
    vector<comp> pow_e;

    FFT(int N): N(N){

        n = 31 - __builtin_clz((signed)N);
        assert(N == (1 << n));

        pow_e.resize(N + 1); 
        pow_e[0] = pow_e[N] = comp(1.0, 0.0);
        double phi = 2.0 * M_PI / N;
        FOR(i, 1, N) pow_e[i] = exp(comp(0, phi * i));

        f.resize(N);
        f_tmp.resize(N);
    }

    void exec(vector<comp> &F, bool inverse = false){
        assert(F.size() == N);
        f.swap(F);
        if(!inverse) forward_exec(0, N, 0);
        else inverse_exec(0, N, 0);
        F.swap(f);
        if(inverse){
            REP(i, N) F[i] /= N;
        }
    }

    vector<comp> convolution(vector<comp> A, vector<comp> B){
        exec(A);
        exec(B);
        vector<comp> C(N);
        REP(i, N) C[i] = A[i] * B[i];
        exec(C, true);
        return C;
    }

    vector<int> int_convolution(vector<int> A, vector<int> B){
        vector<comp> a(N), b(N);
        REP(i, N){
            a[i] = comp(A[i], 0);
            b[i] = comp(B[i], 0);
        }
        vector<comp> c = convolution(a, b);
        vector<int> C(N);
        REP(i, N) C[i] = (int)(c[i].real() + 0.5);
        return C;
    }
};

signed main(){

    int N; cin >> N;
    vec A(N); cin >> A;
    const int P = 200003;

    const int g = 2;
    vec LOG(P);
    int r = 1;
    REP(i, P - 1){
        LOG[r] = i;
        (r *= g) %= P;
    }

    const int sz = bit(19);
    vec cnt(sz, 0);
    REP(i, N) if(A[i] > 0) cnt[LOG[A[i]]]++;
    FFT fft(sz);
    vec conv = fft.int_convolution(cnt, cnt);

    int ans = 0;
    r = 1;
    REP(i, sz){
        int t = conv[i];
        if(i % 2 == 0) t -= cnt[i / 2];
        assert(t % 2 == 0);
        t /= 2;
        ans += r * t;
        (r *= g) %= P;
    }
    Out(ans);

    return 0;
}


Measured memory_bytes: 84724