#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;


ifstream fin("inimioare.in");
ofstream fout("inimioare.out");

int a[101][101],b[101][101],m,n1=0,n2=0,maxima,maximb;


int main()
{
    fin >> m;
    for(int i = 1;i<=m;i++){
        for(int j = 1;j<=4;j++){
            fin >> a[i][j];
        }
    }
    for(int i = 1;i<=m;i++){
        for(int j = 1;j<=4;j++){
            fin >> b[i][j];
        }
    }
    for(int i = 2;i<=m;i++){
        n1 = max(max(max(a[i-1][1] * 10 + a[i-1][2],a[i-1][2] * 10 + a[i-1][1]),max(a[i-1][2] * 10 + a[i-1][3],a[i-1][3] * 10 + a[i-1][2])),max(max(a[i-1][3] * 10 + a[i-1][4],a[i-1][4] * 10 + a[i-1][3]),max(a[i-1][4] * 10 + a[i-1][1],a[i-1][1] * 10 + a[i-1][4])));
        n2 = max(max(max(a[i][1] * 10 + a[i][2],a[i][2] * 10 + a[i][1]),max(a[i][2] * 10 + a[i][3],a[i][3] * 10 + a[i][2])),max(max(a[i][3] * 10 + a[i][4],a[i][4] * 10 + a[i][3]),max(a[i][4] * 10 + a[i][1],a[i][1] * 10 + a[i][4])));
        maxima = max(n1,n2);
    }
    cout << maxima << endl;
    n1 = 0;n2 = 0;
    for(int i = 1;i<=m;i++){
        n1 = max(max(max(b[i-1][1] * 10 + b[i-1][2],b[i-1][2] * 10 + b[i-1][1]),max(b[i-1][2] * 10 + b[i-1][3],b[i-1][3] * 10 + b[i-1][2])),max(max(b[i-1][3] * 10 + b[i-1][4],b[i-1][4] * 10 + b[i-1][3]),max(b[i-1][4] * 10 + b[i-1][1],b[i-1][1] * 10 + b[i-1][4])));
        n2 = max(max(max(b[i][1] * 10 + b[i][2],b[i][2] * 10 + b[i][1]),max(b[i][2] * 10 + b[i][3],b[i][3] * 10 + b[i][2])),max(max(b[i][3] * 10 + b[i][4],b[i][4] * 10 + b[i][3]),max(b[i][4] * 10 + b[i][1],b[i][1] * 10 + b[i][4])));

        maximb = max(n1,n2);
    }
    cout << maximb << endl;
    return 0;
}