#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const ll P = 200003;
const ll MAXN = 210000;
 
string to_string(string s) {
  return '"' + s + '"';
}
 
string to_string(const char* s) {
  return to_string((string) s);
}
 
string to_string(bool b) {
  return (b ? "true" : "false");
}
 
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
 
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
 
void debug_out() { cerr << endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
 
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
 
namespace fft {
  typedef double dbl;
 
  struct num {
    dbl x, y;
    num() { x = y = 0; }
    num(dbl x, dbl y) : x(x), y(y) { }
  };
 
  inline num operator+(num a, num b) { return num(a.x + b.x, a.y + b.y); }
  inline num operator-(num a, num b) { return num(a.x - b.x, a.y - b.y); }
  inline num operator*(num a, num b) { return num(a.x * b.x - a.y * b.y, a.x * b.y + a.y * b.x); }
  inline num conj(num a) { return num(a.x, -a.y); }
 
  ll base = 1;
  vector<num> roots = {{0, 0}, {1, 0}};
  vector<ll> rev = {0, 1};
 
  const dbl PI = acosl(-1.0);
 
  void ensure_base(ll nbase) {
    if (nbase <= base) {
      return;
    }
    rev.resize(1 << nbase);
    for (ll i = 0; i < (1 << nbase); i++) {
      rev[i] = (rev[i >> 1] >> 1) + ((i & 1) << (nbase - 1));
    }
    roots.resize(1 << nbase);
    while (base < nbase) {
      dbl angle = 2 * PI / (1 << (base + 1));
//      num z(cos(angle), sin(angle));
      for (ll i = 1 << (base - 1); i < (1 << base); i++) {
        roots[i << 1] = roots[i];
//        roots[(i << 1) + 1] = roots[i] * z;
        dbl angle_i = angle * (2 * i + 1 - (1 << base));
        roots[(i << 1) + 1] = num(cos(angle_i), sin(angle_i));
      }
      base++;
    }
  }
 
  void fft(vector<num> &a, ll n = -1) {
    if (n == -1) {
      n = a.size();
    }
    assert((n & (n - 1)) == 0);
    ll zeros = __builtin_ctz(n);
    ensure_base(zeros);
    ll shift = base - zeros;
    for (ll i = 0; i < n; i++) {
      if (i < (rev[i] >> shift)) {
        swap(a[i], a[rev[i] >> shift]);
      }
    }
    for (ll k = 1; k < n; k <<= 1) {
      for (ll i = 0; i < n; i += 2 * k) {
        for (ll j = 0; j < k; j++) {
          num z = a[i + j + k] * roots[j + k];
          a[i + j + k] = a[i + j] - z;
          a[i + j] = a[i + j] + z;
        }
      }
    }
/*    for (ll len = 1; len < n; len <<= 1) {
      for (ll i = 0; i < n; i += 2 * len) {
        for (ll j = i, k = i + len; j < i + len; j++, k++) {
          num z = a[k] * roots[k - i];
          a[k] = a[j] - z;
          a[j] = a[j] + z;
        }
      }
    }*/
  }
 
  vector<num> fa, fb;
 
  vector<ll> multiply(vector<ll> &a, vector<ll> &b) {
    ll need = a.size() + b.size() - 1;
    ll nbase = 0;
    while ((1 << nbase) < need) nbase++;
    ensure_base(nbase);
    ll sz = 1 << nbase;
    if (sz > (ll) fa.size()) {
      fa.resize(sz);
    }
    for (ll i = 0; i < sz; i++) {
      ll x = (i < (ll) a.size() ? a[i] : 0);
      ll y = (i < (ll) b.size() ? b[i] : 0);
      fa[i] = num(x, y);
    }
    fft(fa, sz);
    num r(0, -0.25 / sz);
    for (ll i = 0; i <= (sz >> 1); i++) {
      ll j = (sz - i) & (sz - 1);
      num z = (fa[j] * fa[j] - conj(fa[i] * fa[i])) * r;
      if (i != j) {
        fa[j] = (fa[i] * fa[i] - conj(fa[j] * fa[j])) * r;
      }
      fa[i] = z;
    }
    fft(fa, sz);
    vector<ll> res(need);
    for (ll i = 0; i < need; i++) {
      res[i] = fa[i].x + 0.5;
    }
    return res;
  }
 
  vector<ll> multiply_mod(vector<ll> &a, vector<ll> &b, ll m, ll eq = 0) {
    ll need = a.size() + b.size() - 1;
    ll nbase = 0;
    while ((1 << nbase) < need) nbase++;
    ensure_base(nbase);
    ll sz = 1 << nbase;
    if (sz > (ll) fa.size()) {
      fa.resize(sz);
    }
    for (ll i = 0; i < (ll) a.size(); i++) {
      ll x = (a[i] % m + m) % m;
      fa[i] = num(x & ((1 << 15) - 1), x >> 15);
    }
    fill(fa.begin() + a.size(), fa.begin() + sz, num {0, 0});
    fft(fa, sz);
    if (sz > (ll) fb.size()) {
      fb.resize(sz);
    }
    if (eq) {
      copy(fa.begin(), fa.begin() + sz, fb.begin());
    } else {
      for (ll i = 0; i < (ll) b.size(); i++) {
        ll x = (b[i] % m + m) % m;
        fb[i] = num(x & ((1 << 15) - 1), x >> 15);
      }
      fill(fb.begin() + b.size(), fb.begin() + sz, num {0, 0});
      fft(fb, sz);
    }
    dbl ratio = 0.25 / sz;
    num r2(0, -1);
    num r3(ratio, 0);
    num r4(0, -ratio);
    num r5(0, 1);
    for (ll i = 0; i <= (sz >> 1); i++) {
      ll j = (sz - i) & (sz - 1);
      num a1 = (fa[i] + conj(fa[j]));
      num a2 = (fa[i] - conj(fa[j])) * r2;
      num b1 = (fb[i] + conj(fb[j])) * r3;
      num b2 = (fb[i] - conj(fb[j])) * r4;
      if (i != j) {
        num c1 = (fa[j] + conj(fa[i]));
        num c2 = (fa[j] - conj(fa[i])) * r2;
        num d1 = (fb[j] + conj(fb[i])) * r3;
        num d2 = (fb[j] - conj(fb[i])) * r4;
        fa[i] = c1 * d1 + c2 * d2 * r5;
        fb[i] = c1 * d2 + c2 * d1;
      }
      fa[j] = a1 * b1 + a2 * b2 * r5;
      fb[j] = a1 * b2 + a2 * b1;
    }
    fft(fa, sz);
    fft(fb, sz);
    vector<ll> res(need);
    for (ll i = 0; i < need; i++) {
      long long aa = fa[i].x + 0.5;
      long long bb = fb[i].x + 0.5;
      long long cc = fa[i].y + 0.5;
      res[i] = (aa + ((bb % m) << 15) + ((cc % m) << 30)) % m;
    }
    return res;
  }
 
  vector<ll> square_mod(vector<ll> &a, ll m) {
    return multiply_mod(a, a, m, 1);
  }
};

ll B = 2;
ll av[MAXN];
ll rv[MAXN];
vector <ll> ac;

int main()
{
    ios_base::sync_with_stdio(0);

    for (ll i = 0; i < P - 1; i++)
        ac.push_back(0);
    av[0] = 1;
    for (ll i = 1; i < P - 1; i++)
        av[i] = (B * av[i-1]) % P;
    for (ll i = 0; i < P - 1; i++)
        rv[av[i]] = i;

    ll N; cin >> N;
    ll ans = 0;
    for (ll i = 0; i < N; i++)
    {
        ll x; cin >> x;
        if (!x) continue;
        ac[rv[x]]++;
        ans = (ans - (x * x) % P);
    }

    vector <ll> res = fft::multiply (ac, ac);
    for (int i = 0; i < res.size(); i++)
        ans += res[i] * av[i%(P-1)];
    cout << ans / 2 << "\n";
}

Measured memory_bytes: 32148