/*

Seyon Vasantharajan

Grade 11

Woburn C.I.

Intermediate Division

ACSL #1 - Golf

*/

 

#include<iostream>

#include<cstdlib>

#include<ctime>

#include<algorithm>

#include<cmath>

using namespace std;

int main()

{

   int par[9],p[9],k[9],j;

   int parc=0,pc=0,kc=0,ph=0,kh=0,pt=0,kt=0,max=0;

 

                   for (j=0; j<9; j++)

                   {

                                   cin>> par[j] >> p[j] >> k[j] ;

                                  

                                   if (p[j]>k[j])

                                                   ph++;

                                   else if (k[j]>p[j])

                                                   kh++;

          

                                   if (p[j]+k[j]>max)

                                                   max=p[j]+k[j];

                                   parc+=par[j];

                                   pc+=p[j];

                                   kc+=k[j];

                   }

 

                   if (pc>kc)

                                   cout<<kc<<" "<<pc<<endl;

                   else

                       cout<<pc<<"  "<<kc<<endl;

 

                   if (parc-pc<0)

                                   pt=parc-pc;

                   if (parc-pc==0)

                                   pt=0;

                   if (parc-pc>0)

                                   pt=parc-pc;

 

                   if (parc-kc<0)

                                   kt=parc-kc;

                   if (parc-kc==0)

                                   kt=0;

                   if (parc-kc>0)

                                   kt=parc-kc;

 

                   if (pt> kt)

                   {

                                  if (pt==0)

                                                  cout<<"par"<<endl;

                                  if (pt>0)

                                                  cout<<abs(pt)<<" under par"<<endl;

                                  if (pt<0)

                                                  cout<<abs(pt)<<" over par"<<endl;

                     

                                  if (kt==0)

                                                  cout<<"par"<<endl;

                                  if (kt>0)

                                                  cout<<abs(kt)<<" under par"<<endl;

                                  if (kt<0)

                                                  cout<<abs(kt)<<" over par"<<endl;

                   }

       else

                   {                                  

                                  if (kt==0)

                                                  cout<<"par"<<endl;

                                  if (kt>0)

                                                  cout<<abs(kt)<<" under par"<<endl;

                                  if (kt<0)

                                                  cout<<abs(kt)<<" over par"<<endl;

 

                                  if (pt==0)

                                                  cout<<"par"<<endl;

                                  if (pt>0)

                                                  cout<<abs(pt)<<" under par"<<endl;

                                  if (pt<0)

                                                  cout<<abs(pt)<<" over par"<<endl;

                   }

 

                   if (ph>kh)

                                   cout<<ph<<endl;

                   else

                                   cout<<kh<<endl;

 

                   cout<<max<<endl;

 

return 0;

 

}