10.1.18

#include <iostream>
#include <cmath>
#include <string.h>
#include<cstdlib>
#include<ctime>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <map>
#include <stack>
#include <deque>


using namespace std;

int main()
{
    int counter=0;
    deque<int> deq1;
    deque<int> deq2;
    int buff;
    for (int i=0;i<5;i++)
    {
        cin>>buff;
        deq1.push_back(buff);
    }
    for (int i=0;i<5;i++)
    {
        cin>>buff;
        deq2.push_back(buff);
    }
    while (!deq2.empty() && !deq1.empty())
    {
        counter++;
        if (deq1.front()==0 && deq2.front()==9 )
        {deq1.push_back(0);deq1.push_back(9);deq1.pop_front();deq2.pop_front();}
        else
        if (deq2.front()==0 && deq1.front()==9)
        {deq2.push_back(9);deq2.push_back(0);deq1.pop_front();deq2.pop_front();}

        else if (deq2.front()>deq1.front())
        {
            deq2.push_back(deq1.front());deq2.push_back(deq2.front());deq1.pop_front();deq2.pop_front();
        }
        else if (deq1.front()>deq2.front())
        {
            deq1.push_back(deq1.front());deq1.push_back(deq2.front());deq1.pop_front();deq2.pop_front();
        }
        if (counter==1000000) {
            cout<<"botva";
            return 0;
        }

    }
    if (deq2.empty())
    {
       cout<<"first "<<counter;
    }
    else cout<<"second "<<counter;

    return 0;

}