#include <bits/stdc++.h>
using namespace std;
void Halmantechy()
{
cin.tie(0);
cin.sync_with_stdio(0);
cout.tie(0);
cout.sync_with_stdio(0);
}
int main()
{
Halmantechy();
int n,target; cin >> n;
int arr[n];
int counter = 0;
for (int i=0; i<n;i++)
{
cin >> arr[i];
}
sort(arr,arr+n);
target = arr[0] + arr[n-1];
for (int i =0;i < n-1;i++)
{
for(int j=i+1;j<n;j++)
{
if (arr[i]+arr[j] == target && i < j)
{
counter++;
}
}
}
cout << counter;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnZvaWQgSGFsbWFudGVjaHkoKQp7CiAgICBjaW4udGllKDApOwogICAgY2luLnN5bmNfd2l0aF9zdGRpbygwKTsKICAgIGNvdXQudGllKDApOwogICAgY291dC5zeW5jX3dpdGhfc3RkaW8oMCk7Cn0KaW50IG1haW4oKQp7CiAgICBIYWxtYW50ZWNoeSgpOwogICAgaW50IG4sdGFyZ2V0OyBjaW4gPj4gbjsKICAgIGludCBhcnJbbl07CiAgICBpbnQgY291bnRlciA9IDA7CiAgICBmb3IgKGludCBpPTA7IGk8bjtpKyspCiAgICB7CiAgICAgICAgY2luID4+IGFycltpXTsKICAgIH0KICAgIHNvcnQoYXJyLGFycituKTsKICAgIHRhcmdldCA9IGFyclswXSArIGFycltuLTFdOwogICAgZm9yIChpbnQgaSA9MDtpIDwgbi0xO2krKykKICAgIHsKICAgICAgICBmb3IoaW50IGo9aSsxO2o8bjtqKyspCiAgICAgICAgewogICAgICAgICAgICBpZiAoYXJyW2ldK2FycltqXSA9PSB0YXJnZXQgJiYgaSA8IGopCiAgICAgICAgICAgIHsKICAgICAgICAgICAgICAgIGNvdW50ZXIrKzsKICAgICAgICAgICAgfQogICAgICAgIH0KICAgIH0KICAgIGNvdXQgPDwgY291bnRlcjsKCiAgICByZXR1cm4gMDsKfQo=