#include <bits/stdc++.h>

using namespace std;

#define int long long
// #define double long double
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define FORR(i, a, b) for(int i = (a); i > (b); --i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN(x)                                                              \
    for(auto &youso_ : (x)) cin >> youso_
#define bitcnt(x) __builtin_popcount(x)
#define lbit(x) __builtin_ffsll(x)
#define rbit(x) (64 - __builtin_clzll(x))
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
#define rAll(a) (a).rbegin(), (a).rend()
#define sz(s) (ll) s.size()
#define cinfast() cin.tie(0), ios::sync_with_stdio(false)
#define debug(x) cerr << #x << " = " << (x) << endl;
#define loop(x)                                                                \
    LCIN(loop);                                                                \
    while(loop--) {                                                            \
        x;                                                                     \
    }
#define PERM(c)                                                                \
    sort(All(c));                                                              \
    for(bool cp = true; cp; cp = next_permutation(All(c)))
#define COMB(n, k)                                                             \
    for(ll bit = (1LL << k) - 1; bit < (1LL << n); bit = next_combination(bit))
#define PERM2(n, k)                                                            \
    COMB(n, k) {                                                               \
        vector<int> sel;                                                       \
        for(int bitindex = 0; bitindex < n; bitindex++)                        \
            if(bit >> bitindex & 1) sel.emplace_back(bitindex);                \
        PERM(sel) { Printv(sel); }                                             \
    }
#define MKORDER(n)                                                             \
    vector<int> od(n);                                                         \
    iota(All(od), 0LL);

template <typename T = long long> inline T IN() {
    T x;
    cin >> x;
    return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&... tail) {
    cin >> head;
    CIN(move(tail)...);
}
template <class Head> inline void COUT(Head &&head) { cout << (head) << "\n"; }
template <class Head, class... Tail>
inline void COUT(Head &&head, Tail &&... tail) {
    cout << (head) << " ";
    COUT(forward<Tail>(tail)...);
}

#define CINT(...)                                                              \
    int __VA_ARGS__;                                                           \
    CIN(__VA_ARGS__)
#define CCIN(...)                                                              \
    char __VA_ARGS__;                                                          \
    CIN(__VA_ARGS__)
#define DCIN(...)                                                              \
    double __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define LCIN(...)                                                              \
    long long __VA_ARGS__;                                                     \
    CIN(__VA_ARGS__)
#define SCIN(...)                                                              \
    string __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define Printv(v)                                                              \
    {                                                                          \
        REP(hoge, v.size())                                                    \
        cout << v[hoge] << (hoge == v.size() - 1 ? "" : " ");                  \
        cout << "\n";                                                          \
    }
template <typename T = string> inline void eputs(T s) {
    cout << s << "\n";
    exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
    std::fill((T *)array, (T *)(array + N), val);
}

long long next_combination(long long sub) {
    long long x = sub & -sub, y = sub + x;
    return (((sub & ~y) / x) >> 1) | y;
}
template <class T> inline bool chmax(T &a, const T &b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}

// generic lambdas
template <typename first>
#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
[[nodiscard]]
#elif defined(__GNUC__) &&                                                     \
    (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)
__attribute__((warn_unused_result))
#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
static inline constexpr decltype(auto)
fix(first &&f) noexcept {
    return [f = std::forward<first>(f)](auto &&... args) {
        return f(f, std::forward<decltype(args)>(args)...);
    };
}

template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;

typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
typedef pair<ll, ll> PL;
typedef vector<PL> VPL;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;
template <typename T> using V = vector<T>;
template <typename T> using VV = vector<vector<T>>;

const int INF = 1e9;
const ll LINF = 2e18;
// const int MOD = 1e9 + 7;
const int MOD = 998244353;
const int dw[] = {1, 1, 0, -1, -1, -1, 0, 1};
const int dh[] = {0, 1, 1, 1, 0, -1, -1, -1};
#define PI 3.141592653589793230
#define EPS 1e-7

template <typename T> T mypow(T a, ll b) {
    T res(1);
    while(b) {
        if(b & 1) res *= a;
        a *= a;
        b >>= 1;
    }
    return res;
}
ll modpow(ll a, ll b, ll m) {
    ll res(1);
    while(b) {
        if(b & 1) {
            res *= a;
            res %= m;
        }
        a *= a;
        a %= m;
        b >>= 1;
    }
    return res;
}

PL extGcd(ll a, ll b) {
    if(b == 0) return {1, 0};
    PL s = extGcd(b, a % b);
    std::swap(s.first, s.second);
    s.second -= a / b * s.first;
    return std::move(s);
}
PL ChineseRem(const ll &b1, const ll &m1, const ll &b2, const ll &m2) {
    PL sol = extGcd(m1, m2);
    ll p = sol.first, q = sol.second;
    ll tmp = (b2 - b1) * p % m2;
    ll r = (b1 + m1 * tmp + m1 * m2) % (m1 * m2);
    return std::make_pair(r, m1 * m2);
}

class mint {
    ll value;

  public:
    static unsigned int mod;
    mint() : value(0) {}
    template <typename T> mint(T value = 0) : value(value) {
        if(value < 0) value = -(ll)(-value % mod) + mod;
        this->value = value % mod;
    }
    static inline void setMod(const unsigned int &M) { mod = M; }
    inline mint inv() const { return mypow(*this, mod - 2); }
    inline operator int() const { return value; }
    inline mint &operator+=(const mint &x) {
        value += x.value;
        if(value >= mod) value -= mod;
        return *this;
    }
    inline mint &operator++() {
        if(value == mod - 1)
            value = 0;
        else
            value++;
        return *this;
    }
    inline mint operator-() const { return mint(0) -= *this; }
    inline mint &operator-=(const mint &x) {
        value -= x.value;
        if(value < 0) value += mod;
        return *this;
    }
    inline mint &operator--() {
        if(value == 0)
            value = mod - 1;
        else
            value--;
        return *this;
    }
    inline mint &operator*=(const mint &x) {
        value = value * x.value % mod;
        return *this;
    }
    inline mint &operator/=(const mint &rhs) { return *this *= rhs.inv(); }
    template <typename T> mint operator+(const T &rhs) const {
        return mint(*this) += rhs;
    }
    template <typename T> mint &operator+=(const T &rhs) {
        return operator+=(mint(rhs));
    }
    template <typename T> mint operator-(const T &rhs) const {
        return mint(*this) -= rhs;
    }
    template <typename T> mint &operator-=(const T &rhs) {
        return operator-=(mint(rhs));
    }
    template <typename T> mint operator*(const T &rhs) const {
        return mint(*this) *= rhs;
    }
    template <typename T> mint &operator*=(const T &rhs) {
        return operator*=(mint(rhs));
    }
    template <typename T> mint operator/(const T &rhs) const {
        return mint(*this) /= rhs;
    }
    template <typename T> mint &operator/=(const T &rhs) {
        return operator/=(mint(rhs));
    }
    bool operator==(const mint &r) const noexcept {
        return this->value == r.value;
    }
    bool operator!=(const mint &r) const noexcept {
        return this->value != r.value;
    }
};

unsigned int mint::mod = 1000000007;
std::istream &operator>>(std::istream &ist, mint &x) {
    ll a;
    ist >> a;
    x = a;
    return ist;
}

ll const MAX_SIZE = 1e6 + 1;
mint inv[MAX_SIZE];
mint fact[MAX_SIZE];
mint factinv[MAX_SIZE];
void cominit() {
    inv[1] = 1;
    for(int i = 2; i < MAX_SIZE; i++) {
        inv[i] = (-inv[mint::mod % i]) * (mint::mod / i);
    }
    fact[0] = factinv[0] = 1;
    for(int i = 1; i < MAX_SIZE; i++) {
        fact[i] = mint(i) * fact[i - 1];
        factinv[i] = inv[i] * factinv[i - 1];
    }
}
mint comb(int n, int k) {
    if(n >= 0 && k >= 0 && n - k >= 0) {
        return fact[n] * factinv[k] * factinv[n - k];
    }
    return 0;
}
mint hcomb(ll n, ll k) {
    if(n == 0 && k == 0) return 1;
    return comb(n + k - 1, k);
}

// 1012924417,5,2^21
// 924844033,5,2^21
// 998244353,3,2^23
// 1224736769,3,2^24
// 167772161,3,2^25
// 469762049,3,2^26
class NumberTheoreticTransform {
  private:
    static void ntt(std::vector<mint> &a) {
        int sz = a.size();
        if(sz == 1) return;
        mint root = mint::mod == 924844033 || mint::mod == 1012924417 ? 5 : 3;
        if(inverse)
            root = mypow(root, mint::mod - 1 - (mint::mod - 1) / sz);
        else
            root = mypow(root, (mint::mod - 1) / sz);
        std::vector<mint> b(sz), roots((sz >> 1) + 1, 1);
        REP(i, sz >> 1) roots[i + 1] = roots[i] * root;
        for(int i = sz >> 1, w = 1; w < sz; i >>= 1, w <<= 1) {
            for(int j = 0; j < i; j++) {
                for(int k = 0; k < w; k++) {
                    b[k + ((w * j) << 1)] =
                        a[k + w * j] + a[k + w * j + (sz >> 1)];
                    b[k + ((w * j) << 1) + w] =
                        roots[w * j] *
                        (a[k + w * j] - a[k + w * j + (sz >> 1)]);
                }
            }
            std::swap(a, b);
        }
    }

  public:
    static bool inverse;
    template <typename T>
    static std::vector<mint> multiply(std::vector<T> f, std::vector<T> g,
                                      const unsigned int &mod) {
        unsigned int beforeMod = mint::mod;
        mint::setMod(mod);
        if(f.size() < g.size()) std::swap(f, g);
        std::vector<mint> nf, ng;
        int sz = 1;
        while(sz < f.size() + g.size()) sz <<= 1;
        nf.resize(sz);
        ng.resize(sz);
        REP(i, f.size()) {
            nf[i] = f[i];
            if(i < g.size()) ng[i] = g[i];
        }
        inverse = false;
        ntt(nf);
        ntt(ng);
        REP(i, sz) nf[i] *= ng[i];
        inverse = true;
        ntt(nf);
        mint szinv = mint(sz).inv();
        REP(i, sz) nf[i] *= szinv;
        mint::setMod(beforeMod);
        return nf;
    }
    template <typename T>
    static std::vector<ll> multiply_plain(std::vector<T> f, std::vector<T> g) {
        const unsigned int mod1 = 998244353, mod2 = 1224736769;
        std::vector<mint> mul1 = multiply(f, g, mod1);
        std::vector<mint> mul2 = multiply(f, g, mod2);
        std::vector<ll> res(mul1.size());
        REP(i, mul1.size())
        res[i] = ChineseRem(mul1[i], mod1, mul2[i], mod2).first;
        return res;
    }
};

bool NumberTheoreticTransform::inverse = false;

void solve() {
    LCIN(N);
    VL as(N);
    ll P = 200003;
    VECCIN(as);
    VL rev(P), val(2 * P);
    ll now = 1;
    REP(i, 2 * P) {
        if(i < P - 1) rev[now] = i;
        val[i] = now;
        (now *= 2) %= P;
    }
    VL cnt(P);
    REP(i, N) {
        if(as[i]) {
            cnt[rev[as[i]]]++;
        }
    }
    auto res = NumberTheoreticTransform::multiply_plain(cnt, cnt);
    ll ans = 0;
    REP(i, 2 * P) { ans += res[i] * val[i]; }
    REP(i, P) { ans -= val[2 * i] * cnt[i]; }
    assert(ans % 2 == 0);
    COUT(ans / 2);
}

signed main() {
    cinfast();
    // cout << fixed << setprecision(9);
    // loop(solve());
    solve();
}


Measured memory_bytes: 60132