#include <bits/stdc++.h>
using namespace std;

int n;
string s;
vector<int> a;

vector<vector<int>> solve();

int main() {
  cin >> n >> s;
  a.resize(n + 1);
  for (auto &p : a) cin >> p;
  auto res = solve();
  cout << res.size() << endl;
  for (auto &v : res)
    for (int i = 0; i <= n; ++i) cout << v[i] << " \n"[i == n];
  return 0;
}

vector<vector<int>> solve() {
  vector<int> b(n + 1, 0);
  for (int i = 0; i <= n; ++i) {
    int now = i;
    while (now && s[now - 1] == '>')
      b[now - 1] = max(b[now - 1], b[now] + 1), --now;
    now = i;
    while (now < n && s[now] == '<')
      b[now + 1] = max(b[now + 1], b[now] + 1), ++now;
  }
  vector<vector<int>> res;
  auto check = [](vector<int> &v) {
    for (int i = 0; i < n; ++i) {
      if (s[i] == '<' && v[i] >= v[i + 1]) return 0;
      if (s[i] == '>' && v[i] <= v[i + 1]) return 0;
    }
    return 1;
  };
  auto f = [&](int i) {
    vector<vector<int>> v(i, b);
    vector<int> rem(n + 1, 0);
    bool ch = 1;
    for (int j = 0; j <= n; ++j) {
      rem[j] = a[j] - i * b[j];
      if (rem[j] < 0) ch = 0;
    }
    if (!ch) return vector<vector<int>>();
    for (int j = 0; j < i; ++j)
      for (int k = 0; k <= n; ++k) v[j][k] += rem[k] / i + (rem[k] % i > j);
    for (int j = 0; j < i; ++j)
      if (!check(v[j])) {
        ch = 0;
        break;
      }
    if (!ch) return vector<vector<int>>();
    return v;
  };
  int l = 1, r = 10001;
  while (r - l > 1) {
    int mid = (l + r) >> 1;
    if (f(mid).size())
      l = mid;
    else
      r = mid;
  }
  return f(l);
}
#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;
    vi a(2 * n);
    cin >> a;
    multiset <int> ms;
    int ans = 0;
    trav (e, a)
    	ans += e;
    FOR (i, n) {
    	int l = n - 1 - i;
    	int r = n + i;
    	ms.insert(a[l]);
    	ms.insert(a[r]);
    	ans -= *ms.begin();
    	ms.erase(ms.begin());
    }
    cout << ans << endl;
}