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

const long long mod = 1e9 + 7; int n,t[4000][4000],f[4000],ans; long long a[4000];

int main(){ cin>>n; t[1][0] = 1; for(int i = 1;i <= n;i++){ cin>>a[i]; a[i] += a[i-1]; for(int j = 1;j <= i;j++) f[j] = t[j][a[i]%j]; for(int j = 1;j <= i;j++) (t[j+1][a[i]%(j+1)] += f[j]) %= mod; } for(int i = 1;i <= n;i++){ ans += f[i]; ans = ans % mod; } cout<<ans; return 0; }