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

using namespace std;

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

int main()
{
    int x, nrparmin=10, nrparmax=98, v[100], x2=1, ok=0;
    while(fin>>x)
    {
        if(x%2==0 && x>=10 && x<=98)
        {
            v[x2]=x;
            x2++;
        }
    }
    x2--;
    sort(v+1,v+x2+1);
    while(ok==0)
    {
        ok=1;
        for(int i=x2/2+1; i<=x2-1; i++)
        {
            if(v[i]<v[i+1])
            {
                swap(v[i],v[i+1]);
                ok=0;
            }

        }
    }
    for(int i=1; i<=x2; i++)
    {
        if(v[i]==nrparmax)
            nrparmax-=2;
        if(v[i]==nrparmin)
            nrparmin+=2;
    }
    if(nrparmin<nrparmax)
        fout << nrparmin << ' ' << nrparmax;
    else
        fout << "nu exista";
    return 0;
}