#include <iostream>
#include <map>
#include <vector>

using namespace std;

int main()
{
    int p, dba, dbe, dbtalalka=0, x, y, a, e;
    map <int, int> talalka;
    cin >> p;
    cin >> dba;
    vector <int> idopA;
    for (int i=0; i<2*dba; i++)
    {
        cin >> a;
        idopA.insert (idopA.begin()+i, a);
    }
    cin >> dbe;
    vector <int> idopE;
    for (int j=0; j<2*dbe; j++)
    {
        cin >> e;
        idopE.insert (idopE.begin()+j, e);

    }
    cout << "eddig okes" << endl;
    if (dba==dbe)
    {
        for (int k=0; k<2*dba-1; k+=2)
        {
            if (idopA[k]>idopE[k])
            {
                x=idopA[k];
            }
            else x=idopE[k];
            if (idopA[k+1]>idopE[k+1])
            {
                y=idopE[k+1];
            }
            else y=idopA[k+1];
            if (x<y)
            {
                talalka[x]=y;
                dbtalalka++;
            }


        }
    }
    cout << dbtalalka<<endl;
    map <int, int>::iterator it=talalka.begin();
    while (it !=talalka.end())
    {
        cout << it ->first << " "<< it ->second;
        ++it;
    }
    return 0;
}