#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <fstream>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define x first
#define y second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) std::cerr << #x << ": " << x << '\n';
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORN(i, n) for (int i = 1; i <= n; ++i)
#define pb push_back
#define trav(a, x) for (auto& a : x)
using vi = vector<int>;
template <typename T>
std::istream& operator >>(std::istream& input, std::vector<T>& data)
{
    for (T& x : data)
        input >> x;
    return input;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const pair <T, T> & data)
{
    output << "(" << data.x << "," << data.y << ")";
    return output;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const std::vector<T>& data)
{
    for (const T& x : data)
        output << x << " ";
    return output;
}
ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down 
ll math_mod(ll a, ll b) { return a - b * div_down(a, b); }
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>; 
tcT> void re(V<T>& x) { 
    trav(a, x)
        cin >> a;
}
tcT> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}
ll gcd(ll a, ll b) {
    while (b) {
        tie(a, b) = mp(b, a % b);
    }
    return a;
}
signed main() {
    #ifdef LOCAL
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    int n;
    cin >> n;
    string s;
    cin >> s;

    vi a(n + 1);
    cin >> a;

    auto check = [&] (vi a) {
    	trav (e, a) {
    		if (e < 0)
    			return 0;
    	}
    	FOR (i, n) {
    		if (s[i] == '<') {
    			if (a[i] >= a[i + 1])
    				return 0;
    		}
    		else {
    			if (a[i] <= a[i + 1])
    				return 0;
    		}
    	}
    	return 1;
    };

    const int INF = 1e4+7;
    int l = 0, r = INF;
    V <vi> ans;
    while (l < r - 1) {
    	int m = (l + r) / 2;

    	V <vi> d(m, vi (n + 1));
    	FOR (i, n + 1) {
    		FOR (j, m) {
    			d[j][i] = a[i]/m;
    		}
    		FOR (j, a[i]%m) {
    			d[j][i]++;
    		}
    	}

    	bool ok = 1;
    	FOR (i, m) {
    		ok &= check(d[i]);
    	}
    	if (ok) {
    		l = m;
    		ans = d;
    	}
    	else {
    		r = m;
    	}
    }

    cout << l << endl;
    trav (e, ans) {
    	cout << e << endl;
    }
}
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;

    string s;
    cin >> s;

    vector<int> a(n + 1);
    for (int i = 0; i <= n; i++) {
        cin >> a[i];
    }

    int k = 1 << 30;
    for (int i = 0; i < n; i++) {
        k = min(k, abs(a[i + 1] - a[i]));
    }

    cout << k << '\n';
    for (int l = 0; l < k; l++) {
        for (int i = 0; i <= n; i++) {
            cout << a[i] / k + (l < a[i] % k) << " \n"[i == n];
        }
    }

    //差の絶対値の最小がkになりそうだけど 微分する？

    return 0;
}