import java.awt.*;
import java.util.Scanner;
import java.io.*;


public class Dwite_Jan2010_Number2
{
 
  public static void main (String[] args)throws IOException
  {
    FileReader fr;
    BufferedReader br;
    String line;
    int count = 0;
    int countB = -1;
    int countC = 0;
    int countD = 0;
    int[] amountOfNumbers = new int[5];
    int[] numbers = new int[35];
    FileWriter fw;
    PrintWriter writer;
    try
    {
      fr = new FileReader ("DATA2.txt");
      br = new BufferedReader (fr);
      fw = new FileWriter ("OUT2.txt ", true);
      writer = new PrintWriter (fw);
      
      while ((line = br.readLine ()) != null)
      {
        if(count == 0)
        {
          countB++;
          amountOfNumbers[countB] = Integer.parseInt (line);
          count++;
        }
        else if (count > 0)
        {
          if(countC < amountOfNumbers[countB] + countD)
          {
            numbers[countC] = Integer.parseInt (line);
            countC++;
          }
          else
          {
          countD = countC; 
          countB++;
          amountOfNumbers[countB] = Integer.parseInt (line);
          count++;
          }
        }
      }
      Verification v1 = new Verification();
      
      String temp;
      int[] groupOne = new int[amountOfNumbers[0]];
      count = 0;
      for(int i = 0; i < amountOfNumbers[0]; i++)
      {
        groupOne[i] = numbers[count];
        count++;
      }
     
      temp = v1.compare(groupOne, groupOne.length, 0);
      writer.println (temp);
      v1.count = 0;
      v1.doubles = 0;
      
      
      int[] groupTwo = new int[amountOfNumbers[1]];
      for(int i = count, j = 0; j < groupTwo.length; i++, j++)
      {
        groupTwo[j] = numbers[count];
        count++;
      }
      
      
      writer.println (v1.compare(groupTwo, groupTwo.length, 0));
      v1.count = 0;
      v1.doubles = 0;
      
      int[] groupThree = new int[amountOfNumbers[2]];
      for(int i = count, j = 0; j < groupThree.length; i++, j++)
      {
        groupThree[j] = numbers[count];
        count++;
      }

      
      writer.println (v1.compare(groupThree, groupThree.length, 0));
      v1.count = 0;
      v1.doubles = 0;
      
      int[] groupFour = new int[amountOfNumbers[3]];
      for(int i = count, j = 0; j < groupFour.length; i++, j++)
      {
        groupFour[j] = numbers[count];
        count++;
      }
       
      
      writer.println (v1.compare(groupFour, groupFour.length, 0));
      v1.count = 0;
      v1.doubles = 0;
      
      int[] groupFive = new int[amountOfNumbers[4]];
      for(int i = count, j = 0; j < groupFive.length; i++, j++)
      {
        groupFive[j] = numbers[count];
        count++;
      }
      
      writer.println (v1.compare(groupFive, groupFive.length, 0));
      v1.count = 0;
      v1.doubles = 0;
      writer.close();
    }
    catch (IOException e)
    {
      System.out.println("ERROR 1");
    }
    catch (NumberFormatException e)
    {
      System.out.println("ERROR 2");
    }
  }
}

class Verification
{
  int count;
  int doubles;
  boolean maybe;
  
  public Verification()
  {
    count = 0;
    doubles = 0;
    maybe = false;
  }
  public String compare (int[] list, int n, int index)
  {
    System.out.println(n);
    
    double majority = Math.ceil(n/2);
    doubles = 0;
    String verified = "ERROR";
    if(n == 1)
    {
      verified =  "verified";
    }
    else if(index < list.length)
    {
      for(int i = 0; i < n; i++)
      {
        if(i != index)
        {
          if(list[i] == list[index])
          {
            doubles++;
          }
        }
      }
      if(doubles >= majority)
      {
        verified = "verified";
      }
      else if(doubles > 0)
      {
        maybe = true;
      }
       if(doubles < majority)
      {
        verified = compare(list, n, index+1);
      }
   
      count++;
    }
    else
    {
      System.out.println(maybe);
      if(maybe == true)
      {
        verified = "unverified";
      }
       else 
      {
        verified = "unknown";
      }
      maybe = false;
    }
    
    return verified;
  }
}