#include <cstring>
#include <cassert>
#include <utility>
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <bitset>
#include <chrono>
#include <cstdlib>
#include <functional>
#include <tuple>
#include <climits>
#include <limits>
#include <deque>
#include <list>
#include <array>
#include <stack>
#include <queue>
#include <random>
#include <complex>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define ll              long long
#define pi              pair<int,int>
#define pll             pair<ll,ll>
#define pb              push_back
#define F               first
#define S               second
#define vi              vector<int>
#define vll             vector<ll>
#define endl            '\n'
#define all(v)          (v).begin(),(v).end()
#define FOR(i,a,b)      for(int i=a;i<b;i++)
#define MP(a,b)         make_pair(a,b)
#define debug(x)        cerr<< #x << " : " << x << endl;
#define debugp(p)       cerr<< #p << " : " << "(" << (p).first << "," << (p).second << ")\n";
#define debugv(v)       cerr<< #v << " : " << "["; for(int i = 0; i < (v).size(); i++) cerr << v[i] << " "; cerr<<"]\n";
#define debugs(m)       cerr<< #m << " : [ "; for(auto itr = m.begin(); itr != m.end(); itr++) cerr <<*itr << " "; cerr << "]\n";
#define debugm(m)       cerr<< #m << " : [ "; for(auto itr = m.begin(); itr != m.end(); itr++) cerr <<"(" << itr->first << "," << itr->second << ") "; cerr << "]\n";

/* ordered set: 
tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>
member functions :
1. order_of_key(k) : number of elements strictly lesser than k
2. find_by_order(k) : k-th element in the set
*/

inline ll modexp(ll x, ll ex , ll md) {
    ll ans = 1ll;
    while (ex > 0) {
        if (ex & 1ll) ans = (ans * x) % md;
        ex >>= 1ll;
        x = (x * x) % md;
    }
    return ans;
}

const int inf = 1e9 + 7;
const int mod = 1e9 + 7;

void solve(){
  int n;
  cin >> n;
  string s;
  cin >> s;
  // dp[i][c] is the number of ways of forming permutations of length (i+1) such that
  // the last number which we use is the 'c' th largest number
  vector<int> dp(n + 1);
  dp[1] = 1;
  vector<int> pref (n + 1);
  for (int i = 1; i <= n; i++){
    pref[i] = dp[i] + pref[i - 1];
    pref[i] %= mod;
  }
  auto sum = [&] (int i , int j){
    if (j < i) return 0;
    int ret = pref[j] - pref[i - 1];
    ret %= mod;
    if (ret < 0) ret += mod;
    return ret;
  };
  for (int i = 1; i < n; i++){
    vector<int> new_dp(n + 1);
    for (int c = 1; c <= i + 1; c++){
      if (s[i - 1] == '>'){
        new_dp[c] += sum (c , i);
        new_dp[c] %= mod;
        // for (int j = c; j <= i; j++){
        //   new_dp[c] += dp[j];
        //   new_dp[c] %= mod;
        // }
      } else{
        assert (s[i - 1] == '<');
        new_dp[c] += sum(1 , c - 1);
        new_dp[c] %= mod;
        // for (int j = 1; j <= c - 1; j++){
        //   new_dp[c] += dp[j];
        //   new_dp[c] %= mod;
        // }
      }
    }
    swap (dp , new_dp);
    for (int ii = 1; ii <= n; ii++){
      pref[ii] = pref[ii - 1] + dp[ii];
      pref[ii] %= mod;
    }
  }
  int ans = 0;
  for (int j = 1; j <= n; j++){
    ans += dp[j];
    ans %= mod;
  }
  cout << ans << endl;
}
int main(){
    ios :: sync_with_stdio(false); 
    cin.tie(nullptr); 
    cout.tie(nullptr);
    
    int T = 1;
    // cin >> T;
    for(int tc = 1; tc <= T; tc++){
        // cout << "Case #" << tc << ": ";
        solve();
    }
    #ifdef LOCAL
    cerr << "Time elapsed\t: " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n";       
    #endif
}



Measured memory_bytes: 3644