#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <numeric>
#include <complex>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long p = 200003;


template<typename T = double>
class Fast_Fourier_Transform{
  // return the vector of F[t] or f[x] where
  // F[t] = sum of { f[x] * exp(-j * theta * t * x) } in x = 0 .. N-1 (FFT)
  // f(x) = 1/N * sum of { F[t] * exp(j * theta * t * x) } in t = 0 .. N-1 (inverse FFT)
  // where theta = 2*PI / N
  // N == 2^k
  static vector< complex<T> > do_fft(vector< complex<T> > A, bool inverse){
    const T PI = atan2(1, 0) * 2.0;
    const complex<T> j = complex<T>(0,1); // 0 + j*1.0 (j is the imaginary unit)

    int N = A.size();
    int k = 0;  // N = 2^k
    while(N>>k > 0) k++;
    
    for(int bit=0; bit<N; bit++){
      int rbit = 0;
      for(int i=0, tmp_bit = bit; i<k-1; i++, rbit <<= 1, tmp_bit >>=  1){
        rbit |= tmp_bit & 1;
      }
      rbit >>= 1;
      if(bit < rbit){
        swap(A[bit], A[rbit]);
      }
    }

    int dist = 1;
    T theta = -PI;
    if(inverse) theta = -theta;

    for(int level = 1; level<k; level++){
      complex<T> W_n = exp(j * theta);
      complex<T> W(1,0);
      for(int x=0; x < (1<<level-1); x++){
        for(int y=x; y+dist < N; y += (dist<<1)){
          complex<T> tmp = A[ y+dist ] * W;
          A[ y+dist ] = A[ y ] - tmp;
          A[ y ] += tmp;
        }
        W *= W_n;
      }
      dist <<= 1;
      theta *= 0.5;
    }

    if(inverse){
      T k = 1.0/N;
      for(int i=0; i<N; i++){
        A[i] *= k;
      }
    }
    return A;
  }


  template<typename U=T>
  static void vec_resize(vector<U> &A, const U val){
    int n = A.size();
    int k = 1;
    while(n > k) k<<=1;
    A.resize(k, val);
  }

public:
  Fast_Fourier_Transform(){};

  static vector< complex<T> > FFT(vector< complex<T> > A){
    vec_resize<complex<T>>(A, complex<T>(0,0));
    return do_fft(A, false);
  }

  static vector< complex<T> > IFFT(vector< complex<T> > A){
    //vec_resize<complex<T>>(A, complex<T>(0,0));
    return do_fft(A, true);
  }

  static vector< complex<T> > FFT(vector<T> A){
    vec_resize<T>(A, 0);
    vector<complex<T>> B(A.size());
    for(int i=0; i<B.size(); i++){
      B[i] = complex<T>(A[i], 0);
    }

    return do_fft(B, false);
  }

  static vector< complex<T> > FFT(vector<int> A){
    vec_resize<int>(A, T(0));
    vector<complex<T>> B(A.size());
    for(int i=0; i<B.size(); i++){
      B[i] = complex<T>(A[i], 0);
    }
    return do_fft(B, false);
  }

  template <class S=long long>
  static vector<S> round(vector<complex<T>> &&A){
    vector<S> ret(A.size());
    for(int i=0; i<A.size(); i++){
      ret[i] = ::round(A[i].real());
    }
    return ret;
  }

  // vector<double> C | C[i] = ΣA[i]B[j]
  static vector<complex<T>> convolution(vector<T> &A, vector<T> &B){
    reverse(B.begin(), B.end());

    int n = max(A.size(), B.size());
    A.resize(n, 0);
    B.resize(n, 0);

    auto A_FFT = FFT(A);
    auto B_FFT = FFT(B);
    for(int i=0; i<n; i++){
      A_FFT[i] *= B_FFT[i];
    }
    return IFFT(A_FFT);
  }
};


int main(){
  int n;
  cin >> n;
  vector<long long> a(n);
  cin >> a;

  long long g = 2;
  vector<long long> mp(p, -1);
  vector<long long> mp_inv(p, -1);
  long long ans = 0;

  for(long long k=1, i=0; i<p; k=k*g%p, i++){
    mp[k] = i;
    mp_inv[i] = k;
  }

  vector<long long> c(p);
  // map<long long, long long> cnt;
  for(long long x: a){
    if(x == 0) continue;
    c[mp[x]]++;
    // cnt[mp[x]]++;
  }

  // map<long long, long long> cnt2;
  // for(auto x: cnt){
  //   for(auto y: cnt){
  //     cnt2[(x.first + y.first) % (p-1)] += x.second * y.second;
  //   }
  // }
  // for(auto x: cnt2){
  //   int j = x.first;
  //   ans += mp_inv[j] * x.second;
  // }

  vector<long double> x(begin(c), end(c));
  vector<long double> y(begin(c), end(c));
  int kk = 1;
  while(kk < x.size()*2){
    kk <<= 1;
  }
  x.resize(kk);
  y.resize(kk);
  reverse(begin(y), end(y));
  auto res = Fast_Fourier_Transform<long double>::round<>(
    Fast_Fourier_Transform<long double>::convolution(x, y)
    );
  eprintln(res.size());

  for(int i=0; i<res.size(); i++){
    int j = i % (p-1);
    long long k = res[i];
    if(k){
      ans += mp_inv[j] * k;
    }
  }

  eprintln(ans);
  for(long long x: a){
    ans -= x*x % p;
  }

  eprintln(ans);
  ans /= 2;
  eprintln(ans);

  println(ans);

  return 0;
}


Measured memory_bytes: 100212