//开始想法错误,其一是在比较完后需要更新,其二是等比数列完全有可能相隔几个,而不是仅仅只相隔一个,直接暴力解题
#include<iostream>
#include<algorithm>using namespace std;
int main()
{
long long length, i, maxcount=0, dx,count=0;
long long num[105];
cin >> length;
for (i = 1; i <= length; i++)
cin >> num[i];
sort(num + 1, num + length+1);
if (length == 1)
{
cout << 1;
return 0;
}
dx = num[2] - num[1];
long long dx1;
maxcount = 2; count = 2;
for (i = 1; i < length; i++)
for (int j = i + 1; j < length; j++)
{
dx = num[j] - num[i];
count = 2;
for (int k = j + 1; k <= length; k++)
{
if (num[k] - num[i] == count*dx)
count++;
}
maxcount = (maxcount > count) ? maxcount : count;
}
maxcount = (maxcount > count) ? maxcount : count;
cout << maxcount;
return 0;
}