#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.end());
int ans = 0;
for (int i = 0; i < n; i++)
{
int left = 0;
int right = n - 1;
while (left < right)
{
if (i == left)
{
left++;
continue;
}
else if (i == right)
{
right--;
continue;
}
int sum = v[left] + v[right];
if (v[i] == sum)
{
ans++;
break;
}
else if (v[i] < sum)
right--;
else
left++;
}
}
cout << ans;
return 0;
}