Increasing Sequences

//template

#include<bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/trie_policy.hpp>
//using namespace __gnu_pbds;
using namespace std;
//typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;
//typedef trie<string,null_type,trie_string_access_traits<>,pat_trie_tag,trie_prefix_search_node_update> pbtrie;

#define ll                       long long int
#define ld                       long double
#define mod                      1000000007
#define inf                      1e18
#define endl                     "\n"
#define pb                       push_back
#define vi                       vector<ll>
#define vs                       vector<string>
#define pii                      pair<ll,ll>
#define ump                      unordered_map
#define mp                       make_pair
#define pq_max                   priority_queue<ll>
#define pq_min                   priority_queue<ll,vi,greater<ll> >
#define all(n)                   n.begin(),n.end()
#define ff                       first
#define ss                       second
#define mid(l,r)                 (l+(r-l)/2)
#define bitc(n)                  __builtin_popcount(n)
#define SET(a)                   memset( a, -1, sizeof a )
#define CLR(a)                   memset( a,  0, sizeof a )
#define Pi                       3.141592653589793
#define loop(i,a,b)              for(int i=(a);i<=(b);i++)
#define looprev(i,a,b)           for(int i=(a);i>=(b);i--)
#define _fast                    ios_base::sync_with_stdio(0);  cin.tie(0);
#define iter(container,it)       for(__typeof(container.begin()) it = container.begin(); it != container.end(); it++)
#define log(args...)             {string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
#define logarr(arr,a,b)          for(int z=(a);z<=(b);z++) cout<<(arr[z])<<" ";cout<<endl;
template <typename T> T          gcd(T a, T b){if(a%b) return gcd(b,a%b);return b;}
template <typename T> T          lcm(T a, T b){return (a*(b/gcd(a,b)));}
vs tokenizer(string str,char ch) {std::istringstream var((str)); vs v; string t; while(getline((var), t, (ch))) {v.pb(t);} return v;}

void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cout << *it << " = " << a << endl;
err(++it, args...);
}

void solve() {
    int n,k,L; string s; cin >> n >> s;
    ll dp[n+1][n+1],mx[n+1][n+1];
    CLR(dp),CLR(mx);

    // finding max length string which matches
    looprev(i,n-1,0) {
        looprev (j,n-1,0) {
            if (s[i] != s[j]) mx[i][j] = 0;
            else
                mx[i][j] = 1 + mx[i+1][j+1];
        }
    }

    //base case
    loop (i,0,n) {
         dp[0][i] = 1;
         dp[i][0] = 1;
    }
   //creating the actual dp
    loop (j,1,n) {
        loop (i,1,n) {
            k = 1;
            while (j > k) {
                dp[i][j] = (dp[i][j] + dp[i-j][k])%mod;
                k++;
            }
            L = mx[i-2*j+1][i-j+1];
            if (i < 1 || (i-2*j+L+1 < 0) || (i-j+L+1 < 0) || (i-j < 0)) continue;
            if (L < j && s[i-2*j+L+1] < s[i-j+L+1])
                dp[i][j] = (dp[i][j] + dp[i-j][j])%mod;
        }
    }


    ll ans = 0;
    loop (j,1,n) ans = (ans + dp[n][j])%mod;

    cout << ans << "\n";
}

int main(int argc, char const *argv[]){
    _fast
    ll t=1;
    while(t--){
     solve();
    }
  return 0;
}