#include <atcoder/convolution>
#include <atcoder/modint>
#include <bits/stdc++.h>

using namespace std;
using namespace atcoder;

using mint = modint998244353;

int main() {
    const int fac_size = 600000;
    vector<mint> fac(fac_size);
    vector<mint> inv_fac(fac_size);
    fac[0] = 1;
    inv_fac[0] = 1;
    for (int i = 1; i < fac_size; i++) {
    	fac[i] = fac[i - 1] * i;
    }
    inv_fac[fac_size - 1] = 1 / fac[fac_size - 1];
    for (int i = fac_size - 2; i >= 1; i--) {
    	inv_fac[i] = inv_fac[i + 1] * (i + 1);
    }
    
    int n;
    string s;
    cin >> n;
    cin >> s;
    int p = 0;
    for (int i = 0; i < n - 1; i++) {
    	if (s[i] == '<') {
    		p++;
    	}
    }
    if (p == 0) {
    	cout << 0 << endl;
    	return 0;
    }
    p %= 2;
    vector<vector<mint>> dp(n, vector<mint>(2));
    dp[0][0] = 1;
    for (int i = 0; i < n - 1; i++) {
    	vector<vector<mint>> newdp(n, vector<mint>(2));
    	for (int j = 0; j <= i; j++) {
    		if (s[i] == '>') {
    			newdp[j][0] += dp[j][0] + dp[j][1];
    		}
    		newdp[j + 1][1] += dp[j][0]; 
    	}
    	dp = newdp;
    }
    mint ans = 0;
    for (int i = 0; i < n; i++) {
    	mint num = fac[2 * (n - i)] * inv_fac[n - i] * inv_fac[n - i] / (n - i + 1) * (dp[i][0] + dp[i][1]);
    	if (i % 2 == p) {
    		ans += num;
    	} else {
    		ans -= num;
    	}
    }
    cout << ans.val() << endl;
    return 0;
}