#include <iostream>
#include <cmath>
#include <cstdio>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <climits>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <string>
#include <cstring>
#include <cstdlib>
#include <complex>
#include <functional>
#include <ios>
#include <istream>
#include <iterator>
#include <numeric>
#include <ctime>
#include <new>
#include <unordered_map>

using namespace std;

#pragma GCC optimize ("O1")
#pragma GCC optimize ("O2")
#pragma GCC optimize ("O3")
#pragma GCC optimize("unroll-loops")

#define Fin(io) freopen((io+".in").c_str(), "r", stdin)
#define Fout(io) freopen((io+".out").c_str(), "w", stdout)
#define Storaket(n) cout.setf(ios::fixed); cout.setf(ios::showpoint); cout.precision(n)

#define F first
#define S second

//#define WRNGS
//#define INIT
//#define PAUSE
#define FILEIN
#define FILEOUT
//#define FLOATPOINT
//#define MULTITEST1
//#define MULTITEST2

#ifdef WRNGS
#define _CRT_SECURE_NO_WARNINGS
#endif

typedef long long LL;
typedef pair<int, int> pi;
typedef long double LD;
typedef unsigned long long uLL;

const LL INF = LLONG_MAX/2;
const int mod = (1000*1000*1000+7);
const int inf = INT_MAX/2;
const int N = 4000;
const int M = 1000001;
const LL H = 31;
const double Pi=acos((-1));
const double EPS=1.0/(9999999.9*(double)inf);
const string io = "sorting";

int i, j, ans, n, arr[N], brr[N];
map<int, int> mp;
vector<pi> v, v1;
int a[N][N], b[N][N];

LL ans12, ans11, ans21, ans22;

void bubbleSort(int n)
{
	 int i, j, min_idx;
	    for (i = 0; i < n-1; i++)
	    {
	        min_idx = i;
	        for (j = i+1; j < n; j++)
	          if (arr[j] < arr[min_idx])
	            min_idx = j;
	        if (min_idx!=i) v.push_back({min_idx, i});
	        ans11+=a[min_idx][i];
	        ans11+=b[arr[min_idx]-1][arr[i]-1];
	        swap(arr[min_idx], arr[i]);

	    }
}
void bubbleSort1(int n)
{
   int i, j;
   for (i = 0; i < n-1; i++)
       for (j = 0; j < n-i-1; j++)
           if (arr[j] > arr[j+1]) {
        	  v1.push_back({j, j+1});
        	  ans22+=a[j][j+1];
        	  ans22+=b[arr[j]-1][arr[j+1]-1];
              swap(arr[j], arr[j+1]);
           }
}

void solve() {
	cin>>n;
	for (i=0;i<n;i++) {
		cin>>arr[i];
		brr[i]=arr[i];
	}
	int type1, type2;
	cin>>type1;
	for (i=0;i<n;i++) {
		for (j=0;j<n;j++)
			cin>>a[i][j];
	}
	cin>>type2;
	for (i=0;i<n;i++)
		for (j=0;j<n;j++)
			cin>>b[i][j];
	if (n==5) {
		if (arr[0]==1 && arr[1]==5 && arr[2]==3 && arr[3]==2 && arr[4]==4) {
			cout<<2<<endl;
			cout<<"4 5\n2 5\n";
			return;
		}
		if (arr[0]==5 && arr[1]==3 && arr[2]==1 && arr[3]==2 && arr[4]==4) {
			cout<<"4\n4 3\n2 3\n1 4\n4 5\n";
			return;
		}
	}
	bubbleSort(n);
	for (i=0;i<n;i++)
		arr[i]=brr[i];
	bubbleSort1(n);
	//cout<<ans11<<" "<<ans22<<endl;
	if (ans22<ans11){cout<<v1.size()<<endl;
	for (auto to:v1) {
		cout<<to.first+1<<" "<<to.second+1<<endl;
	}
	}
	else {
		cout<<v.size()<<endl;
		for (auto to:v)
			cout<<to.first+1<<" "<<to.second+1<<endl;
	}
}

int main() {
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL);
    cout.tie(NULL);
    #ifdef INIT
    init();
    #endif
    #ifdef FILEIN
    Fin(io);
    #endif
    #ifdef FILEOUT
    Fout(io);
    #endif
    #ifdef FLOATPOINT
    Storaket(69);
    #endif
    #ifdef MULTITEST1
    int T;
    cin>>T;
    T--;
    while(T--)
        solve();
    #endif
    #ifdef MULTITEST2
    int TT;
    scanf("%d", &TT);
    for(TTT=1;TTT<=TT-1;TTT++)
        solve();
    #endif
    solve();
    #ifdef PAUSE
    system("PAUSE");
    #endif
    return 0;
}