//It is made by wfj_2048~

 #include <algorithm>

 #include <iostream>

 #include <complex>

 #include <cstring>

 #include <cstdlib>

 #include <cstdio>

 #include <vector>

 #include <cmath>

 #include <queue>

 #include <stack>

 #include <map>

 #include <set>

 #define rhl (1000000007)

 #define inf (1<<30)

 #define N (300010)

 #define il inline

 #define RG register

 #define ll long long

 #define File(s) freopen(s".in","r",stdin),freopen(s".out","w",stdout)

 using namespace std;

 int f[N],a[N],b[N],n,ans;

 il int gi(){

     RG int x=,q=; RG char ch=getchar();

     while ((ch<'' || ch>'') && ch!='-') ch=getchar();

     if (ch=='-') q=-,ch=getchar();

     while (ch>='' && ch<='') x=x*+ch-,ch=getchar();

     return q*x;

 }

 il void work(){

     n=gi(); for (RG int i=;i<=n;++i) a[i]=gi(),b[a[i]]=i;

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

     ans+=(f[i]++); if (ans>=rhl) ans-=rhl;

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

         if (b[s]>i){ f[b[s]]+=f[i]; if (f[b[s]]>=rhl) f[b[s]]-=rhl; }

     }

     printf("%d\n",ans); return;

 }

 int main(){

     File("gift");

     work();

     return ;

 }