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

ll n,ans;
ll a[110000],dp[110000];

int main(){
    freopen("bzoj_4300.in","r",stdin);
    freopen("bzoj_4300.out","w",stdout);
    cin>>n;
    for (int i=1;i<=n;i++){
        cin>>a[i];
        dp[i]=1;
    }
    for (int i=2;i<=n;i++){
        for (int j=1;j<i;j++){
            if ((a[i]&a[j])!=0){
                dp[i]=max(dp[i],dp[j]+1);
            }
        }
    }
    for (int i=1;i<=n;i++){
        ans=max(ans,dp[i]);
    }
    cout<<ans;
    fclose(stdin);
    fclose(stdout);
    return 0;
}