#include<iostream>
#include<vector>
#include<stack>
#include<fstream>
#include<algorithm>
#include<cmath>
using namespace std;
int cost_pos[401][401];
int cost_num[401][401];
int min_cs[401][401];
int min_cm[401][401];
int nums[401];
int nums1[401];
int n;
int type1,type2;
int nump[401];
int nump1[401];
int swaps[1000001][2],k,cost;
int swaps1[1000001][2],k1,cost1;
int partition (int arr[], int low, int high)
{
    int pivot = arr[high];
    int i = (low - 1);
    for (int j = low; j <= high- 1; j++)
    {
        if (arr[j] <= pivot)
        {
            //if(arr[i+1]!=arr[j])
            //{
            //cout<<arr[i]<<" "<<arr[j]<<"dsfhjkhg"<<endl;
            i++;
            if(arr[i]!=arr[j])
            {
                swaps[k][0]=nump[arr[i]];
                swaps[k][1]=nump[arr[j]];
                k++;
            }
            swap(arr[i], arr[j]);
            cost+=cost_num[arr[i]][arr[j]];
            cost+=cost_pos[nump[arr[i]]][nump[arr[j]]];
            swap(nump[arr[i]],nump[arr[j]]);
            //}
        }
    }
    if(arr[i+1]!=arr[high])
    {
        swaps[k][0]=nump[arr[i+1]];
        swaps[k][1]=nump[arr[high]];
        k++;
        swap(nump[arr[i+1]],nump[arr[high]]);
        cost+=cost_num[arr[i+1]][arr[high]];
        cost+=cost_pos[nump[arr[i+1]]][nump[arr[high]]];
        swap(arr[i + 1], arr[high]);
    }
    /*for(int i=0; i<n; i++)
        cout<<nums[i]<<" ";
    cout<<endl;*/
    return (i + 1);
}

void quickSort(int arr[], int low, int high)
{
    /*for(int i=0; i<n; i++)
        cout<<nums[i]<<" ";
    cout<<endl;*/
    if (low < high)
    {
        int pi = partition(arr, low, high);
        quickSort(arr, low, pi - 1);
        quickSort(arr, pi + 1, high);
    }
}
bool cmp(int x,int y)
{
    for(int i=0; i<n; i++)
        cout<<nums[i]<<" ";
    cout<<endl;
    //
    bool res = x < y;
    if(res==1)
    {
        swaps[k][0]=nump[x];
        swaps[k][1]=nump[y];
        swap(nump[x],nump[y]);
        k++;
    }
    return res;
}
int sort1(int arr[],int l)
{
    for(int i=0; i<l; i++)
    {
        /*for(int j=0; j<l; j++)
            cout<<nump1[arr[j]]<<" ";
        cout<<endl;
        cout<<i<<endl;*/
        if(arr[i]!=i+1)
        {
            swaps1[k1][0]=nump1[arr[i]];
            swaps1[k1][1]=nump1[i+1];
            k1++;
            //cout<<arr[i]<<" "<<arr[nump1[i+1]-1]<<"|"<<nump1[arr[i]]<<" "<<nump1[i+1]<<endl;
            int a=arr[i];
            cost1+=cost_num[ arr[i] ][ i+1 ];
            cost1+=cost_pos[ nump1[arr[i]] ][ nump1[i+1] ];
            swap(arr[i],arr[ nump1[i+1]-1 ]);
            swap(nump1[a],nump1[i+1]);
        }
        //cout<<arr[i]<<" "<<i<<endl;
    }
}
int main()
{
    freopen("sorting.in","r",stdin);
    freopen("sorting.out","w",stdout);
    ios::sync_with_stdio(false);
    cin>>n;
    for(int i=0; i<n; i++)
    {
        cin>>nums[i];
        nums1[i]=nums[i];
        nump[nums[i]]=i+1;
        nump1[nums[i]]=i+1;
    }
    cin>>type1;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            cin>>cost_pos[i][j];
    cin>>type2;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
            cin>>cost_num[i][j];
    quickSort(nums,0,n-1);
    sort1(nums1,n);
    /*for(int i=0; i<n; i++)
        cout<<nums[i]<<" ";*/
    if(cost1<cost)
    {
        cout<<k1<<endl;
        for(int i=0; i<k1; i++)
        {
            cout<<swaps1[i][0]<<" "<<swaps1[i][1]<<endl;
        }
    }
    else
    {
        cout<<k<<endl;
        for(int i=0; i<k; i++)
        {
            cout<<swaps[i][0]<<" "<<swaps[i][1]<<endl;
        }
    }
    return 0;
}
/**
5
1 5 3 2 4
1
0 17 3 12 16
17 0 3 6 1
3 3 0 11 8
12 6 11 0 3
16 1 8 3 0
1
0 10 5 6 17
10 0 16 4 17
5 16 0 4 20
6 4 4 0 14
17 17 20 14 0

7
4 7 2 5 1 3 6
0
0 0 0 0 0 0 0
0 0 0 0 0 0 0
0 0 0 0 0 0 0
0 0 0 0 0 0 0
0 0 0 0 0 0 0
0 0 0 0 0 0 0
0 0 0 0 0 0 0
0
0 0 0 0 0 0 0
0 0 0 0 0 0 0
0 0 0 0 0 0 0
0 0 0 0 0 0 0
0 0 0 0 0 0 0
0 0 0 0 0 0 0
0 0 0 0 0 0 0

for(int i=0; i<n; i++)
    cout<<nums[i]<<" ";
cout<<endl;
*/