#include<cstdio>

 #include<cstring>

 #include<algorithm>

 using namespace std;

 const int N=;

 const long long mod=1e9+;

 long long a[N],dp[N],pos[N];

 long long n,ans;

 int main()

 {

     scanf("%lld",&n);

     for(int i=;i<=n;i++)

     {

         scanf("%lld",&a[i]);

         pos[a[i]]=i,dp[i]=;

     }

     for(int i=n;i;i--)

     {

         dp[i]=;

         for(int j=a[i];j;j=a[i]&(j-))

             if(pos[j]>i) dp[i]=(dp[i]+dp[pos[j]])%mod;

         ans+=dp[i];

     }

     printf("%lld",(ans-n+mod)%mod);

     return ;

 }