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

// clang-format off
/* accelration */
// 高速バイナリ生成
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
// cin cout の結びつけ解除, stdioと同期しない(入出力非同期化)
// cとstdの入出力を混在させるとバグるので注意
struct Fast {Fast() {std::cin.tie(0); ios::sync_with_stdio(false);}} fast;

/* alias */
using ull = unsigned long long;
using ll = long long;
using vi = vector<int>;
using vl = vector<long>;
using vll = vector<long long>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vvll = vector<vll>;
using vs = vector<string>;
using pii = pair<int, int>;

/* define short */
#define pb push_back
#define mp make_pair
#define all(obj) (obj).begin(), (obj).end()
#define YESNO(bool) if(bool){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define yesno(bool) if(bool){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define YesNo(bool) if(bool){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}

/* REP macro */
#define reps(i, a, n) for (ll i = (a); i < (ll)(n); ++i)
#define rep(i, n) reps(i, 0, n)
#define rrep(i, n) reps(i, 1, n + 1)
#define repd(i,n) for(ll i=n-1;i>=0;i--)
#define rrepd(i,n) for(ll i=n;i>=1;i--)

/* debug */
// 標準エラー出力を含む提出はrejectされる場合もあるので注意
#define debug(x) cerr << "\033[33m(line:" << __LINE__ << ") " << #x << ": " << x << "\033[m" << endl;

/* func */
inline int in_int() {int x; cin >> x; return x;}
inline ll in_ll() {ll x; cin >> x; return x;}
inline string in_str() {string x; cin >> x; return x;}
// search_length: 走査するベクトル長の上限(先頭から何要素目までを検索対象とするか、1始まりで)
template <typename T> inline bool vector_finder(std::vector<T> vec, T element, unsigned int search_length) {
    auto itr = std::find(vec.begin(), vec.end(), element);
    size_t index = std::distance( vec.begin(), itr );
    if (index == vec.size() || index >= search_length) {return false;} else {return true;}
}
template <typename T> inline void print(const vector<T>& v, string s = " ")
    {rep(i, v.size()) cout << v[i] << (i != (ll)v.size() - 1 ? s : "\n");}
template <typename T, typename S> inline void print(const pair<T, S>& p)
    {cout << p.first << " " << p.second << endl;}
template <typename T> inline void print(const T& x) {cout << x << "\n";}
template <typename T, typename S> inline void print(const vector<pair<T, S>>& v)
    {for (auto&& p : v) print(p);}
// 第一引数と第二引数を比較し、第一引数(a)をより大きい/小さい値に上書き
template <typename T> inline bool chmin(T& a, const T& b) {bool compare = a > b; if (a > b) a = b; return compare;}
template <typename T> inline bool chmax(T& a, const T& b) {bool compare = a < b; if (a < b) a = b; return compare;}
// gcd lcm
// C++17からは標準実装
// template <typename T> T gcd(T a, T b) {if (b == 0)return a; else return gcd(b, a % b);}
// template <typename T> inline T lcm(T a, T b) {return (a * b) / gcd(a, b);}
// clang-format on

struct P {
    double x, y;
};

int main() {

    int N;
    P p0, pp;

    cin >> N >> p0.x >> p0.y >> pp.x >> pp.y;


    P c_;
    c_.x = 0.5 * (p0.x + pp.x);
    c_.y = 0.5 * (p0.y + pp.y);

    P cx;
    cx.x = (-c_.x + p0.x);
    cx.y = (-c_.y + p0.y);

    double pi = -3.1415926535;
    double c = cos(pi / N);
    double s = sin(pi / N);

    P e;
    e.x = c_.x + c * (c * cx.x + s * cx.y);
    e.y = c_.y + c * (-s * cx.x + c * cx.y);

    cout << 2 * e.x - p0.x << "\t" << 2 * e.y - p0.y;


    return 0;
}

#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

int main(void)
{
    int n=0;
    int a[200000] = {};
    // int counter[200000] = {};
    long long count=0,temp_count=1;
    int i=0,j=0;

    cin >> n;

    for (i=0;i<n;i++){
        cin  >> a[i];
    }

    for(i=0;i<n;i++){
        a[i] %= 200;
    }
    sort(a,a+n,greater<int>());

    for(i=0;i<n-1;i++){
        for (j=i+1;j<n;j++){
            if(a[i]!= a[j] ) {
                count += (temp_count*(temp_count-1))/2;
                temp_count=1;
                i=j-1;
                break;
            }
            else temp_count++;
            if(j == n-1) {
                count += (temp_count*(temp_count-1))/2;
                temp_count=1;
                i=j-1;
                break;
            }
        }

    }

    // cout << count << endl;
    printf("%ld",count);

    return 0;
}