#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#include <random>
#include <unordered_set>
#include <unordered_map>
#define all(a) (a).begin(), (a).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define range(i, a, b) for (ll i = (a); i < (b); i++)
#define pb push_back
#define debug(x) cerr << __LINE__ << ' ' << #x << ':' << (x) << '\n'
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef complex<ld> com;
template<class T> using pri_s = priority_queue<T, vector<T>, greater<T>>;
template<class T> using pri_b = priority_queue<T>;
constexpr int inf = 1000000010;
constexpr ll INF = 1000000000000000010;
constexpr int mod1e9 = 1000000007;
constexpr int mod998 = 998244353;
constexpr ld eps = 1e-12;
constexpr ld pi = 3.141592653589793238;
constexpr ll ten(int n) { return n ? 10 * ten(n - 1) : 1; };
int dx[] = { 1,0,-1,0,1,1,-1,-1 }; int dy[] = { 0,1,0,-1,1,-1,1,-1 };
ll mul(ll a, ll b) { return (a > INF / b ? INF : a * b); }
void fail() { cout << "-1\n"; exit(0); } void no() { cout << "No\n"; exit(0); }
template<class T> void er(T a) { cout << a << '\n'; exit(0); }
template<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; }
template<class T> istream &operator >> (istream &s, vector<T> &v) { for (auto &e : v) s >> e; return s; }
template<class T> ostream &operator << (ostream &s, const vector<T> &v) { for (auto &e : v) s << e << ' '; return s; }
template<class T, class U> ostream &operator << (ostream &s, const pair<T, U> &p) { s << p.first << ' ' << p.second; return s; }

struct fastio {
	fastio() {
		cin.tie(0); cout.tie(0);
		ios::sync_with_stdio(false);
		cout << fixed << setprecision(20);
		cerr << fixed << setprecision(20);
	}
}fastio_;

int main() {
	int n;
	string s;
	cin >> n >> s;
	vector<int> a(n + 1);
	cin >> a;
	int k = inf;
	rep(i, n) chmin(k, abs(a[i] - a[i + 1]));
	cout << k << '\n';
	vector<vector<int>> ans(k, vector<int>(n + 1));
	rep(i, k) rep(j, n + 1) ans[i][j] = a[j] / k;
	rep(i, k) rep(j, n + 1) if (a[j] % k > i) ans[i][j]++;
	rep(i, k) cout << ans[i] << '\n';
}
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi pair<int,int>
#define pb push_back
#define fi first
#define sc second
#define ull unsigned long long
const int maxn=4e5+10;
const int mod=1e9+7;


char a[maxn],b[maxn];

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=1;i<=n;i++) cin>>b[i];
    int m;
    cin>>m;
    int f=0;//0 为a在前 1为a在后
    while(m--)
    {
        int t,x,y;
        cin>>t>>x>>y;
        if(t==2)
        {
            f=!f;
        }
        else
        {
            if(x>n&&y>n)
            {
                x-=n,y-=n;
                if(f) swap(a[x],a[y]);
                else swap(b[x],b[y]);
            }
            else if(x<=n&&y<=n)
            {
                if(f) swap(b[x],b[y]);
                else swap(a[x],a[y]);
            }
            else
            {
                if(x>n)
                {
                    if(f)
                    {
                        x-=n;
                        swap(a[x],b[y]);
                    }
                    else
                    {
                        x-=n;
                        swap(a[y],b[x]);
                    }
                }
                else
                {
                    y-=n;
                    if(f)
                    {
                        swap(a[y],b[x]);
                    }
                    else
                    {
                        swap(a[x],b[y]);
                    }
                }
            }
        }
    }
    if(f) cout<<(b+1)<<(a+1)<<'\n';
    else cout<<(a+1)<<(b+1)<<'\n';










}




















