#include<bits/stdc++.h>
using namespace std;
#define light ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define pb push_back
#define all(c) c.begin(),c.end()
#define PI 3.14159265358979323846
const ll MAX = 1e4+10;
const ll INF = 1e18;
const ll MOD = 1e9+7;

vector<int> digits;
int d,n;
int dp[MAX][110][2];

ll digitdp(int pos,int sum,int flag)
{
    if(pos==n)
    {
        if(sum==0)
            return 1;
        return 0;
    }
    if(dp[pos][sum][flag]!=-1)
        return dp[pos][sum][flag];
    int limit = (flag==1)?digits[pos]:9;
    ll tot = 0;
    for(int i=0;i<=limit;i++)
    {
        if(digits[pos]==i)
            tot=(tot+digitdp(pos+1,(sum+i)%d,flag))%MOD;
        else
            tot=(tot+digitdp(pos+1,(sum+i)%d,0))%MOD;
    }
        return dp[pos][sum][flag] = tot;
}

int main()
{
    memset(dp,-1,sizeof(dp));
    int i,j,l;
    string k;
    cin >> k >> d;
    l = k.length();
    for(i=0;i<l;i++)
        digits.pb(k[i]-'0');
    n = digits.size();
    ll ans = (digitdp(0,0,1)-1+MOD)%MOD;
    cout << ans;
}
#include <bits/stdc++.h>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=1e9+7;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};

const int M=2000000;
ll n,a[M],b[M];

int main(){
	cin>>n;
	ll g=0,cnt=0,res=0;
	for(int i=0;i<n;i++){
		int x;
		cin>>x;
		g^=x;
		if(g==0){
			cnt++;
			if(i==n-1){
				for(auto j:a) (res+=j)%=mod;
				(res+=1)%=mod;
			}
			ll t=a[g]+1;
			(a[g]+=t)%=mod;
		}
		else{
			ll t=(a[g]*cnt-b[g]+1+mod)%mod;
			(a[g]+=t)%=mod;
			(b[g]+=t*cnt)%=mod;
			if(i==n-1) res=t;
		}
	}
	cout<<res<<endl;
}