#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define ALL(c) (c).begin(), (c).end()

constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }

template <class T, class U>
void chmin(T& t, const U& u) {
    if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
    if (t < u) t = u;
}

template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    rep(i, v.size()) {
        if (i) os << ",";
        os << v[i];
    }
    os << "}";
    return os;
}

#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << H;
    debug_out(T...);
}
#define debug(...) \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

template <unsigned int MOD>
struct ModInt {
    using uint = unsigned int;
    using ull = unsigned long long;
    using M = ModInt;

    uint v;

    ModInt(ll _v = 0) { set_norm(_v % MOD + MOD); }
    M& set_norm(uint _v) {  //[0, MOD * 2)->[0, MOD)
        v = (_v < MOD) ? _v : _v - MOD;
        return *this;
    }

    explicit operator bool() const { return v != 0; }
    M operator+(const M& a) const { return M().set_norm(v + a.v); }
    M operator-(const M& a) const { return M().set_norm(v + MOD - a.v); }
    M operator*(const M& a) const { return M().set_norm(ull(v) * a.v % MOD); }
    M operator/(const M& a) const { return *this * a.inv(); }
    M& operator+=(const M& a) { return *this = *this + a; }
    M& operator-=(const M& a) { return *this = *this - a; }
    M& operator*=(const M& a) { return *this = *this * a; }
    M& operator/=(const M& a) { return *this = *this / a; }
    M operator-() const { return M() - *this; }
    M& operator++(int) { return *this = *this + 1; }
    M& operator--(int) { return *this = *this - 1; }

    M pow(ll n) const {
        if (n < 0) return inv().pow(-n);
        M x = *this, res = 1;
        while (n) {
            if (n & 1) res *= x;
            x *= x;
            n >>= 1;
        }
        return res;
    }

    M inv() const {
        ll a = v, b = MOD, p = 1, q = 0, t;
        while (b != 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(p -= t * q, q);
        }
        return M(p);
    }

    bool operator==(const M& a) const { return v == a.v; }
    bool operator!=(const M& a) const { return v != a.v; }
    friend ostream& operator<<(ostream& os, const M& a) { return os << a.v; }
    static int get_mod() { return MOD; }
};

using Mint1 = ModInt<998244353>;
using Mint2 = ModInt<1012924417>;  // 5

// depend on ModInt, must use NTT friendly mod

template <class D>
struct NumberTheoreticTransform {
    D root;
    V<D> roots = {0, 1};
    V<int> rev = {0, 1};
    int base = 1, max_base = -1;

    void init() {
        int mod = D::get_mod();
        int tmp = mod - 1;
        max_base = 0;
        while (tmp % 2 == 0) {
            tmp /= 2;
            max_base++;
        }

        root = 2;

        while (true) {
            if (root.pow(1 << max_base).v == 1) {
                if (root.pow(1 << (max_base - 1)).v != 1) {
                    break;
                }
            }
            root++;
        }
    }

    void ensure_base(int nbase) {
        if (max_base == -1) init();
        if (nbase <= base) return;
        assert(nbase <= max_base);

        rev.resize(1 << nbase);
        for (int i = 0; i < (1 << nbase); ++i) {
            rev[i] = (rev[i >> 1] >> 1) + ((i & 1) << (nbase - 1));
        }
        roots.resize(1 << nbase);

        while (base < nbase) {
            D z = root.pow(1 << (max_base - 1 - base));
            for (int i = 1 << (base - 1); i < (1 << base); ++i) {
                roots[i << 1] = roots[i];
                roots[(i << 1) + 1] = roots[i] * z;
            }
            ++base;
        }
    }

    void ntt(V<D>& a, bool inv = false) {
        int n = a.size();
        // assert((n & (n - 1)) == 0);
        int zeros = __builtin_ctz(n);
        ensure_base(zeros);
        int shift = base - zeros;

        for (int i = 0; i < n; i++) {
            if (i < (rev[i] >> shift)) {
                swap(a[i], a[rev[i] >> shift]);
            }
        }

        for (int k = 1; k < n; k <<= 1) {
            for (int i = 0; i < n; i += 2 * k) {
                for (int j = 0; j < k; j++) {
                    D x = a[i + j];
                    D y = a[i + j + k] * roots[j + k];
                    a[i + j] = x + y;
                    a[i + j + k] = x - y;
                }
            }
        }

        int v = D(n).inv().v;
        if (inv) {
            reverse(a.begin() + 1, a.end());
            for (int i = 0; i < n; i++) {
                a[i] *= v;
            }
        }
    }

    V<D> mul(V<D> a, V<D> b) {
        int s = a.size() + b.size() - 1;
        int nbase = 1;
        while ((1 << nbase) < s) nbase++;
        int sz = 1 << nbase;
        a.resize(sz);
        b.resize(sz);
        ntt(a);
        ntt(b);

        for (int i = 0; i < sz; i++) {
            a[i] *= b[i];
        }
        ntt(a, true);

        a.resize(s);
        return a;
    }
};

using R = __int128;

/// g:gcd(a, b), ax+by=g
struct EG {
    R g, x, y;
};

EG ext_gcd(R a, R b) {
    if (b == 0) {
        if (a >= 0)
            return EG{a, 1, 0};
        else
            return EG{-a, -1, 0};
    } else {
        auto e = ext_gcd(b, a % b);
        return EG{e.g, e.y, e.x - a / b * e.y};
    }
}

const int P = 200003;
int main() {
    NumberTheoreticTransform<Mint1> ntt1;
    NumberTheoreticTransform<Mint2> ntt2;

    ntt1.init();
    ntt2.init();

    V<int> A(P);

    int N;
    cin >> N;
    // N = 200000;
    V<int> in(N);
    // rep(i, N) in[i] = 200000;
    rep(i, N) {
        cin >> in[i];
        A[in[i]]++;
    }

    A[0] = 0;

    auto B = A;

    int g = 1;
    {
        while (true) {
            ll t = 1;
            int ord = 0;
            while (true) {
                t = t * g % P;
                ++ord;
                if (t == 1) {
                    break;
                }
            }
            if (ord == P - 1) {
                break;
            }
            ++g;
        }
    }

    V<Mint1> va1(P - 1), vb1(P - 1);
    V<Mint2> va2(P - 1), vb2(P - 1);
    int x = 1;

    rep(i, P - 1) {
        va1[i] = A[x];
        va2[i] = A[x];
        x = (ll)x * g % P;
    }

    vb1 = va1;
    vb2 = va2;

    auto vec1 = ntt1.mul(va1, vb1);
    auto vec2 = ntt2.mul(va2, vb2);
    rep(i, vec1.size()) if (i >= P - 1) { vec1[i - (P - 1)] += vec1[i]; }
    rep(i, vec2.size()) if (i >= P - 1) { vec2[i - (P - 1)] += vec2[i]; }
    V<Mint1> ans1(P);
    V<Mint2> ans2(P);
    x = 1;
    rep(i, P - 1) {
        ans1[x] = vec1[i];
        ans2[x] = vec2[i];
        x = (ll)x * g % P;
    }
    V<ll> ans(P);
    rep(i, N) {
        ll m = (ll)in[i] * in[i] % P;
        ans[m]--;
    }

    const R mod = (R)998244353 * 1012924417;

    {
        R a = Mint1::get_mod(), b = Mint2::get_mod();
        auto res = ext_gcd(a, b);
        rep(i, P) if (i) {
            R x = (R)res.x * ((R)ans2[i].v - (R)ans1[i].v) * Mint1::get_mod() +
                  ans1[i].v;
            x %= mod;
            if (x < 0) x += mod;
            ans[i] += x;
            /*
            if (ans[i] % 2 != 0 || ans[i] < 0) {
                debug(i, ans[i]);
            }*/

            assert(ans[i] % 2 == 0 && ans[i] >= 0);
            ans[i] /= 2;
        }
    }
    ll sum = 0;
    rep(i, P) sum += i * ans[i];
    cout << sum << endl;
    return 0;
}

Measured memory_bytes: 26132