/* monkukui 競技プログラミング用のテンプレート  (ここから) */
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
#include <bitset>

using namespace std;
using lint = long long int;
using ll = long long int;
using lnt = long long int;
using graph = vector<vector<int>>;
using wgraph = vector<vector<pair<int, long long int>>>;
long long int INF = 1001001001001001LL;
int inf = 100100100;
long long int MOD = 1000000007LL;
double PI = 3.1415926535897932;
long long int di[] = {-1, 0, 1, 0, -1, 1, 1, -1};
long long int dj[] = {0, 1, 0, -1, 1, 1, -1, -1};

template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
inline void yes(){ cout << "yes" << endl; }
inline void Yes(){ cout << "Yes" << endl; }
inline void YES(){ cout << "YES" << endl; }
inline void no(){ cout << "no" << endl; }
inline void No(){ cout << "No" << endl; }
inline void NO(){ cout << "NO" << endl; }
inline void possible(){ cout << "possible" << endl; }
inline void Possible(){ cout << "Possible" << endl; }
inline void POSSIBLE(){ cout << "POSSIBLE" << endl; }
inline void impossible(){ cout << "impossible" << endl; }
inline void Impossible(){ cout << "Impossible" << endl; }
inline void IMPOSSIBLE(){ cout << "IMPOSSIBLE" << endl; }

#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define drep(i,n) for(int i = (n)-1; i >= 0; i--)
#define srep(i,s,t) for(int i = s; i < t; i++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back

/* monkukui 競技プログラミング用のテンプレート (ここまで)*/


// 抽象累積和
// 構築 O(n), get O(1)

template<typename T>
struct CumSum{
private: 
  size_t n;
  vector<T> dat;

public: 
  CumSum(const vector<T> &v){
    n = v.size();
    dat.resize(n + 1, 0);
    for(size_t i = 0; i < n; i++){
      dat[i + 1] = (dat[i] + v[i]) % MOD;
    }
  }

  T get(size_t r) const { // 0-indexed, [0. r)
    return dat[r] % MOD;
  }

  T get(size_t l, size_t r){ // 0-indexed, [l, r)
    return (dat[r] - dat[l] + MOD) % MOD;
  }
};

int main(){
  
  int n; cin >> n;
  string s; cin >> s;
  
  vector<vector<lint>> dp(n + 1, vector<lint> (n + 1, 0));

  // 区間和のみ取得できれば良い
  // 累積和でいいんじゃね

  for(int j = 0; j < n; j++) dp[0][j] = 1;
  for(int i = 1; i < n; i++) {
    // 累積和を構築
    CumSum<lint> cs(dp[i - 1]);

    if(s[i - 1] == '<') {
      for(int j = 0; j <= n - i; j++) {
        int r = n - i + 1;
        int l = j + 1;
        lint sum = cs.get(l, r);
        dp[i][j] += sum;
        dp[i][j] %= MOD;
      }
    } else {
      for(int j = 0; j < n - i; j++) {
        int r = j + 1;
        int l = 0;
        lint sum = cs.get(l, r);
        dp[i][j] += sum;
        dp[i][j] %= MOD;
      }
    }
  }

  /*
  for(int i = 0; i <= n; i++) {
    for(int j = 0; j <= n; j++) {
      cout << dp[i][j] << " ";
    }
    cout << endl;
  }*/
    

  cout << dp[n - 1][0] % MOD << endl;
  
  return 0;
}


Measured memory_bytes: 70784