#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
vector<int> arr(n);
for(int i = 0; i < n; i++)
cin >> arr[i];
int res = INT_MIN;
for(int i = 0; i < n; i++){
for(int j = i+1; j < n; j++){
int l = arr[i]+arr[j];
unordered_map<int,int> mp;
for(int k = 0; k < n; k++){
mp[arr[k]]++;
}
int ans = 0;
unordered_map<int,int> vis;
for(auto k : mp){
int val = k.first;
int freq = k.second;
int req = l-val;
if(vis.find(val) != vis.end() || vis.find(req) != vis.end())
continue;
if(mp.find(req) != mp.end()){
if(val == req)
ans += freq/2;
else{
ans += min(freq, mp[req]);
}
vis[req]++;
vis[val]++;
}
}
res = max(res,ans);
}
}
cout << res;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBuOyBjaW4gPj4gbjsKCXZlY3RvcjxpbnQ+IGFycihuKTsKCWZvcihpbnQgaSA9IDA7IGkgPCBuOyBpKyspCgljaW4gPj4gYXJyW2ldOwoJCglpbnQgcmVzID0gSU5UX01JTjsKCQoJZm9yKGludCBpID0gMDsgaSA8IG47IGkrKyl7CgkJZm9yKGludCBqID0gaSsxOyBqIDwgbjsgaisrKXsKCQkJaW50IGwgPSBhcnJbaV0rYXJyW2pdOwoJCQkKCQkJdW5vcmRlcmVkX21hcDxpbnQsaW50PiBtcDsKCSAgICAgICAgZm9yKGludCBrID0gMDsgayA8IG47IGsrKyl7CgkgICAgICAgICAgICBtcFthcnJba11dKys7CgkgICAgICAgIH0KCSAgICAgICAgaW50IGFucyA9IDA7CgkgICAgICAgIHVub3JkZXJlZF9tYXA8aW50LGludD4gdmlzOwoJICAgICAgICBmb3IoYXV0byBrIDogbXApewoJICAgICAgICAgICAgaW50IHZhbCA9IGsuZmlyc3Q7CgkgICAgICAgICAgICBpbnQgZnJlcSA9IGsuc2Vjb25kOwoJICAgICAgICAgICAgaW50IHJlcSA9IGwtdmFsOwoJICAgICAgICAgICAgaWYodmlzLmZpbmQodmFsKSAhPSB2aXMuZW5kKCkgfHwgdmlzLmZpbmQocmVxKSAhPSB2aXMuZW5kKCkpCgkgICAgICAgICAgICBjb250aW51ZTsKCSAgICAgICAgICAgIGlmKG1wLmZpbmQocmVxKSAhPSBtcC5lbmQoKSl7CgkgICAgICAgICAgICAgICAgaWYodmFsID09IHJlcSkKCSAgICAgICAgICAgICAgICBhbnMgKz0gZnJlcS8yOwoJICAgICAgICAgICAgICAgIGVsc2V7CgkgICAgICAgICAgICAgICAgICAgIGFucyArPSBtaW4oZnJlcSwgbXBbcmVxXSk7CgkgICAgICAgICAgICAgICAgfQoJICAgICAgICAgICAgICAgIHZpc1tyZXFdKys7CgkgICAgICAgICAgICAgICAgdmlzW3ZhbF0rKzsKCSAgICAgICAgICAgIH0KCSAgICAgICAgfQoJICAgICAgICByZXMgPSBtYXgocmVzLGFucyk7CgkJfQoJfQoJY291dCA8PCByZXM7CglyZXR1cm4gMDsKfQ==