import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex, std.typecons;
import core.bitop, core.thread;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) throw new EOFException; tokens = readln.split; } auto token = tokens[0]; tokens.popFront; return token; }
int readInt() { return readToken().to!int; }
long readLong() { return readToken().to!long; }
real readReal() { return readToken().to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


immutable MO = 10L^^9 + 7;

int N;
string S;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      S = readToken();
      auto dp = new long[][](N, N + 1);
      dp[0][0 .. N] = 1;
      foreach (i; 0 .. N - 1) {
        foreach (x; 0 .. N - i) {
          switch (S[i]) {
            case '<': {
              (dp[i + 1][x] += dp[i][x]) %= MO;
              (dp[i + 1][N - i] -= dp[i][x]) %= MO;
            } break;
            case '>': {
              (dp[i + 1][0] += dp[i][x]) %= MO;
              (dp[i + 1][x] -= dp[i][x]) %= MO;
            } break;
            default: assert(false);
          }
        }
        foreach (x; 1 .. N - i) {
          (dp[i + 1][x] += dp[i + 1][x - 1]) %= MO;
        }
        debug {
          writefln("dp[%s] = %s", i + 1, dp[i + 1]);
        }
      }
      const ans = dp[N - 1][0];
      ans = (ans % MO + MO) % MO;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
