import java.io.*;
import java.util.*;
public class C680 {
public static void main(String[] args) throws IOException {
	input.init(System.in);
	int x = 1;
	int count = 0;
	int[] ps = new int[]{2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
	for(int i = 0; i<ps.length; i++)
	{
		int cur = x * ps[i];
		if(cur > 100) break;
		System.out.println(cur);
		System.out.flush();
		String s = input.next();
		if(s.equals("yes"))
		{
			x *= ps[i];
			count++;
		}
	}
	System.out.println(count < 2 ? "prime" : "composite");
	System.out.flush();
}

public static class input {
	static BufferedReader reader;
	static StringTokenizer tokenizer;

	static void init(InputStream input) {
		reader = new BufferedReader(new InputStreamReader(input));
		tokenizer = new StringTokenizer("");
	}

	static String next() throws IOException {
		while (!tokenizer.hasMoreTokens())
			tokenizer = new StringTokenizer(reader.readLine());
		return tokenizer.nextToken();
	}

	static int nextInt() throws IOException {
		return Integer.parseInt(next());
	}

	static double nextDouble() throws IOException {
		return Double.parseDouble(next());
	}

	static long nextLong() throws IOException {
		return Long.parseLong(next());
	}
}
}


import java.io.*;
import java.util.*;
public class C680 {
public static void main(String[] args) throws IOException {
	input.init(System.in);
	int x = 1;
	int count = 0;
	int[] ps = new int[]{2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
	for(int i = 0; i<ps.length; i++)
	{
		int cur = x * ps[i];
		if(cur > 100) break;
		System.out.println(cur);
		System.out.flush();
		String s = input.next();
		if(s.equals("yes"))
		{
			x *= ps[i];
			count++;
			i--;
		}
	}
	System.out.println(count < 2 ? "prime" : "composite");
	System.out.flush();
}

public static class input {
	static BufferedReader reader;
	static StringTokenizer tokenizer;

	static void init(InputStream input) {
		reader = new BufferedReader(new InputStreamReader(input));
		tokenizer = new StringTokenizer("");
	}

	static String next() throws IOException {
		while (!tokenizer.hasMoreTokens())
			tokenizer = new StringTokenizer(reader.readLine());
		return tokenizer.nextToken();
	}

	static int nextInt() throws IOException {
		return Integer.parseInt(next());
	}

	static double nextDouble() throws IOException {
		return Double.parseDouble(next());
	}

	static long nextLong() throws IOException {
		return Long.parseLong(next());
	}
}
}


import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.List;
import java.util.ArrayList;

public class P680C {
  InputStream is;
  PrintWriter out;
  String INPUT = "yes no";

  private List<Integer> primeNumbers(int n) {
    boolean[] primes = new boolean[n];
    Arrays.fill(primes, true);
    primes[0] = true;
    primes[1] = true;
    List<Integer> res = new ArrayList<>();
    for (int i = 2; i < n; i++) {
      if (primes[i]) {
        res.add(i);
        for (int j = i + i; j < n; j+=i) {
          primes[j] = false;
        }
      }
    }
    return res;
  }

  void solve() {
    List<Integer> a = primeNumbers(100);
    int cnt = 0;
    int found = 0;
    while (a.size() > 0) {
      int num = a.get(0);
      a.remove(0);
      cnt++;
      if (cnt == 20) {
        break;
      }
      if (isDivide(num)) {
        found++;
        if (found == 2) {
          System.out.println("composite");
          System.out.flush();
          return;
        }
        if (num * num <= 100) {
          a.add(0, num * num);
        }
      }
    }
    System.out.println("prime");
    System.out.flush();
  }

  private boolean isDivide(int num) {
    System.out.println(num);
    System.out.flush();
    String ans = ns();
    return ans.equals("yes");
  }

  public static void main(String[] args) throws Exception {
    new P680C().run();
  }

  void run() throws Exception {
    is = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());
    out = new PrintWriter(System.out);

    long s = System.currentTimeMillis();
    solve();
    out.flush();
    tr(System.currentTimeMillis() - s + "ms");
  }

  private byte[] inbuf = new byte[1024];
  private int lenbuf = 0, ptrbuf = 0;

  private int readByte() {
    if (lenbuf == -1)
      throw new InputMismatchException();
    if (ptrbuf >= lenbuf) {
      ptrbuf = 0;
      try {
        lenbuf = is.read(inbuf);
      } catch (IOException e) {
        throw new InputMismatchException();
      }
      if (lenbuf <= 0)
        return -1;
    }
    return inbuf[ptrbuf++];
  }

  private boolean isSpaceChar(int c) {
    return !(c >= 33 && c <= 126);
  }

  private int skip() {
    int b;
    while ((b = readByte()) != -1 && isSpaceChar(b))
      ;
    return b;
  }

  private double nd() {
    return Double.parseDouble(ns());
  }

  private char nc() {
    return (char) skip();
  }

  private String ns() {
    int b = skip();
    StringBuilder sb = new StringBuilder();
    while (!(isSpaceChar(b))) { // when nextLine, (isSpaceChar(b) && b != ' ')
      sb.appendCodePoint(b);
      b = readByte();
    }
    return sb.toString();
  }

  private char[] ns(int n) {
    char[] buf = new char[n];
    int b = skip(), p = 0;
    while (p < n && !(isSpaceChar(b))) {
      buf[p++] = (char) b;
      b = readByte();
    }
    return n == p ? buf : Arrays.copyOf(buf, p);
  }

  private char[][] nm(int n, int m) {
    char[][] map = new char[n][];
    for (int i = 0; i < n; i++)
      map[i] = ns(m);
    return map;
  }

  private int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private int ni() {
    int num = 0, b;
    boolean minus = false;
    while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))
      ;
    if (b == '-') {
      minus = true;
      b = readByte();
    }

    while (true) {
      if (b >= '0' && b <= '9') {
        num = num * 10 + (b - '0');
      } else {
        return minus ? -num : num;
      }
      b = readByte();
    }
  }

  private long nl() {
    long num = 0;
    int b;
    boolean minus = false;
    while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'))
      ;
    if (b == '-') {
      minus = true;
      b = readByte();
    }

    while (true) {
      if (b >= '0' && b <= '9') {
        num = num * 10 + (b - '0');
      } else {
        return minus ? -num : num;
      }
      b = readByte();
    }
  }

  private boolean oj = true;

  private void tr(Object... o) {
    if (!oj)
      System.out.println(Arrays.deepToString(o));
  }
}


import java.io.*;
import java.util.StringTokenizer;

public class Codeforces680C {

	public static void main(String[] args) {
		try {
			BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
			int[] primes = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
			int numYes = 0;
			for(int i = 0; i < primes.length; i++) {
				System.out.println(primes[i]);
				System.out.flush();
				String s = f.readLine();
				if(s.equals("yes")) {
					numYes++;
				}
			}
			if(numYes == 0 || numYes == 1)
				System.out.println("prime");
			else
				System.out.println("composite");
		}
		catch(IOException e) {
			e.printStackTrace();
		}
	}

}


import java.io.*;
import java.util.StringTokenizer;

public class Codeforces680C {

	public static void main(String[] args) {
		try {
			BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
			int[] primes = {2, 3, 5, 7};
			boolean isPrime = true;
			for(int i = 0; i < 4; i++) {
				System.out.println(primes[i]);
				System.out.flush();
				String s = f.readLine();
				if(s.equals("yes")) {
					isPrime = false;
					System.out.println("composite");
					break;
				}
			}
			if(isPrime)
				System.out.println("prime");
		}
		catch(IOException e) {
			e.printStackTrace();
		}
	}

}


import java.io.*;
import java.util.StringTokenizer;

public class Codeforces680C {

	public static void main(String[] args) {
		try {
			BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
			int[] primes = {2, 3, 5, 7};
			int numYes = 0;
			for(int i = 0; i < 4; i++) {
				System.out.println(primes[i]);
				System.out.flush();
				String s = f.readLine();
				if(s.equals("yes")) {
					numYes++;
				}
			}
			if(numYes == 0 || numYes == 1)
				System.out.println("prime");
			else
				System.out.println("composite");
		}
		catch(IOException e) {
			e.printStackTrace();
		}
	}

}


import java.io.*;
import java.util.StringTokenizer;

public class Codeforces680C {
	public static String output(int d, int n) {
		if(n%d == 0)
			return "yes";
		return "no";
	}
	public static void main(String[] args) {
		try {
			BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
			//for(int n = 2; n <= 100; n++) {
			int[] primes = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 4, 9, 25, 49};
			int numYes = 0;
			for(int i = 0; i < primes.length; i++) {
				System.out.println(primes[i]);
				System.out.flush();
				//String s = output(primes[i], n);
				String s = f.readLine();
				if(s.equals("yes")) {
					numYes++;
				}
			}
			if(numYes == 0 || numYes == 1)
				System.out.println("prime");
			else
				System.out.println("composite");
			//}
		}
		catch(Exception e) {
			e.printStackTrace();
		}
	}

}


import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

public class Temp
{
	public static void main(String[] args) throws IOException {

		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		int[] arr={2,3,4,5,6,7,9,25,49,11,13,17,19,23,29,31,37,41,43,47};
		int count=0;
		for(int i=0;i<arr.length;i++)
		{
			System.out.println(arr[i]);
			System.out.flush();
			String s=br.readLine();
			if(s.equals("yes"))
				count++;
			if(count==2)
				break;

		}
		if(count<=1)
			System.out.println("prime");
		else
			System.out.println("composite");
	}
}


import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

public class Temp
{
	public static void main(String[] args) throws IOException {

		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		int[] arr={2,3,4,5,6,7,9,25,49,11,13,17,19,23,29,31,37,41,43,47};
		int count=0;
		for(int i=0;i<arr.length;i++)
		{
			System.out.println(arr[i]);
			System.out.flush();
			String s=br.readLine();
			if(s.equals("yes"))
				count++;
			if(count==2)
				break;

		}
		if(count==1)
			System.out.println("prime");
		else
			System.out.println("composite");
	}
}


import java.util.*;
import java.math.*;
public class Udhan240{
    public static void main(String[] args) {
       int[] i={2,3,4,5,7,9,11,13,17,19,23,25,29,31,37,39,41,43,47,49};
       Scanner scan=new Scanner(System.in);
       int u=0;
       for(int x=0;x<i.length;x++){
        System.out.println(i[x]);
        String s=scan.next();
        if(s.equals("yes")){
         u=u+1;
        }
       }
       if(u>=2){
        System.out.println("composite");
       }else{
         System.out.println("prime");
       }
       System.out.flush();
    }
}


import java.util.*;
import java.math.*;
public class Udhan240{
    public static void main(String[] args) {
       int[] i={2,3,5,7,11,13,17,19,23,29,31,37,39,41,43,47,49};
       Scanner scan=new Scanner(System.in);
       boolean b=false;
       for(int x=0;x<i.length;x++){
        System.out.println(i[x]);
        String s=scan.next();
        if(s.equals("yes")){
         b=true;
         break;
        }
       }
       if(b==true){
        System.out.println("composite");
       }else{
         System.out.println("prime");
       }
       System.out.flush();
    }
}


import java.util.*;
import java.math.*;
public class Udhan240{
    public static void main(String[] args) {
       int[] i={2,3,4,5,6,7,8,11,13,17,19,23,29,31,37,39,41,43,47,49};
       Scanner scan=new Scanner(System.in);
       int u=0;
       for(int x=0;x<i.length;x++){
        System.out.println(i[x]);
        String s=scan.next();
        if(s.equals("yes")){
         u=u+1;
        }
       }
       if(u>=2){
        System.out.println("composite");
       }else{
         System.out.println("prime");
       }
       System.out.flush();
    }
}


import java.util.*;
import java.math.*;
public class Udhan240{
    public static void main(String[] args) {
       int[] i={2,3,5,7,11,13,17,19,23,29,31,37,39,43,47,49};
       Scanner scan=new Scanner(System.in);
       boolean b=false;
       for(int x=0;x<i.length;x++){
        System.out.println(i[x]);
        String s=scan.next();
        if(s.equals("yes")){
         b=true;
         break;
        }
       }
       if(b==true){
        System.out.println("composite");
       }else{
         System.out.println("prime");
       }
       System.out.flush();
    }
}


import java.util.ArrayList;
import java.util.Scanner;

/**
 * Created by 1 on 08.06.2016.
 */
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int numb = 2;
        int count = 0;
        int streak = 0;
        boolean mozhno;
        String chat = "";
        ArrayList<Integer> list = new ArrayList<>();
        boolean arch = true;
        while (count < 2 && numb <= 100 && streak < 20)
        {
            mozhno = false;
            if (numb == 2)
                numb = numb;
            else
            {
                while (numb <= 100 && !mozhno)
                {
                    if (list.size() > 0)
                    for (int i = 0; i < list.size(); i++)
                        if (numb % list.get(i) != 0) mozhno = true;
                        else
                        {
                            numb++;
                            mozhno = false;
                            break;
                        }
                    else {
                        mozhno = true;
                        numb++;
                    }
                }
            }
            System.out.println(numb);
            chat = sc.next();
            if (chat.equals("yes")) count++;
            else list.add(numb);
            streak++;
            numb++;
        }
        if (count > 1) System.out.println("composite");
        else System.out.println("prime");
        System.out.flush();
    }
}


import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            boolean[] prime = new boolean[101];
            Arrays.fill(prime, true);
            ArrayList<Integer> primes = new ArrayList<>();
            for (int i = 2; i < prime.length; i++) {
                if (prime[i]) {
                    primes.add(i);
                    for (int j = i * i; j < prime.length; j += i) {
                        prime[j] = false;
                    }
                }
            }
            for (int p : primes) {
                if (p * p > 100) {
                    out.println("composite");
                    return;
                }
                out.println(p);
                out.flush();
                String ans = in.next();
                if (ans.equals("yes")) {
                    for (int p2 : primes) {
                        if (p2 * p > 100) {
                            out.println("prime");
                            return;
                        }
                        if (p2 > p) {
                            out.println(p2);
                            out.flush();
                            ans = in.next();
                            if (ans.equals("yes")) {
                                out.println("composite");
                                return;
                            }
                        }
                    }
                }
            }
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

    }
}


import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            boolean[] prime = new boolean[101];
            Arrays.fill(prime, true);
            ArrayList<Integer> primes = new ArrayList<>();
            for (int i = 2; i < prime.length; i++) {
                if (prime[i]) {
                    primes.add(i);
                    for (int j = i * i; j < prime.length; j += i) {
                        prime[j] = false;
                    }
                }
            }
            for (int p : primes) {
                if (p * p > 100) {
                    out.println("prime");
                    return;
                }
                out.println(p);
                out.flush();
                String ans = in.next();
                if (ans.equals("yes")) {
                    out.println(p * p);
                    out.flush();
                    ans = in.next();
                    if (ans.equals("yes")) {
                        out.println("composite");
                        return;
                    }
                    for (int p2 : primes) {
                        if (p2 * p > 100) {
                            out.println("prime");
                            return;
                        }
                        if (p2 > p) {
                            out.println(p2);
                            out.flush();
                            ans = in.next();
                            if (ans.equals("yes")) {
                                out.println("composite");
                                return;
                            }
                        }
                    }
                }
            }
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

    }
}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;

public class C {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(System.out);
		int[] nums = {2,4,3,9,5,25,7,49,11,13,17,19,23,29,31,37,41,43,47};
		int div = 0;
		for(int num : nums){
			out.println(num);
			out.flush();
			String response = in.readLine();
			if(response.equals("yes")){
				div++;
			}
		}
		if(div<=1){
			out.println("prime");
			out.flush();
		}
		else{
			out.println("composite");
			out.flush();
		}
	}
}


import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Bp {

	public static void main(String[] args)
	{
		// TODO Auto-generated method stub
		MyScannerbp sc=new MyScannerbp();
		int p[]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};
		int i;
		int count=0;
		int flag=0;
		String ans;
		for(i=0;i<15;i++)
		{
			boolean d=false;
			System.out.println(p[i]);
			ans=sc.next();
			if(ans.equals("yes"))
			{	count++;
				d=true;
			}
			if(count>=2)
			{
				flag=1;
				break;
			}
			if((p[i]*p[i])<100 && d)
			{
				System.out.println(p[i]*p[i]);
				ans=sc.next();
				if(ans.equals("yes"))
					count++;
			}
			if(count>=2)
			{
				flag=1;
				break;
			}
		}
		if(flag==0)
			System.out.println("prime");
		else
			System.out.println("composite");
		System.out.flush();
	}

}
class MyScannerbp
{
	BufferedReader br;
	StringTokenizer st;
	MyScannerbp()
	{
		br=new BufferedReader(new InputStreamReader(System.in));
	}
	String next()
	{

		while(st==null || !st.hasMoreTokens())
		{
			try
			{
				st=new StringTokenizer(br.readLine());
			}
			catch(Exception e)
			{
				e.printStackTrace();
			}
		}
		return st.nextToken();

	}
	int nextInt()
	{
		return Integer.parseInt(next());
	}
	long nextLong()
	{
		return Long.parseLong(next());
	}
	double nextDouble()
	{
		return Double.parseDouble(next());
	}
	String nextLine()
	{
		String str="";
		try
		{
			str=br.readLine();
		}
		catch(Exception e)
		{
			e.printStackTrace();
		}
		return str;

	}
}


import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Bp {

	public static void main(String[] args)
	{
		// TODO Auto-generated method stub
		MyScannerbp sc=new MyScannerbp();
		int p[]={2,3,5,7,11,13,17,19,23,29,31,37,41,47};
		int i;
		int count=0;
		int flag=0;
		String ans;
		for(i=0;i<14;i++)
		{
			boolean d=false;
			System.out.println(p[i]);
			ans=sc.next();
			if(ans.equals("yes"))
			{	count++;
				d=true;
			}
			if(count>=2)
			{
				flag=1;
				break;
			}
			if((p[i]*p[i])<100 && d)
			{
				System.out.println(p[i]*p[i]);
				ans=sc.next();
				if(ans.equals("yes"))
					count++;
			}
			if(count>=2)
			{
				flag=1;
				break;
			}
		}
		if(flag==0)
			System.out.println("prime");
		else
			System.out.println("composite");
		System.out.flush();
	}

}
class MyScannerbp
{
	BufferedReader br;
	StringTokenizer st;
	MyScannerbp()
	{
		br=new BufferedReader(new InputStreamReader(System.in));
	}
	String next()
	{

		while(st==null || !st.hasMoreTokens())
		{
			try
			{
				st=new StringTokenizer(br.readLine());
			}
			catch(Exception e)
			{
				e.printStackTrace();
			}
		}
		return st.nextToken();

	}
	int nextInt()
	{
		return Integer.parseInt(next());
	}
	long nextLong()
	{
		return Long.parseLong(next());
	}
	double nextDouble()
	{
		return Double.parseDouble(next());
	}
	String nextLine()
	{
		String str="";
		try
		{
			str=br.readLine();
		}
		catch(Exception e)
		{
			e.printStackTrace();
		}
		return str;

	}
}


import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Bp {

	public static void main(String[] args)
	{
		// TODO Auto-generated method stub
		MyScannerbp sc=new MyScannerbp();
		int p[]={2,3,5,7,11,13,17,23,29,31,37,41,47};
		int i;
		int count=0;
		int flag=0;
		String ans;
		for(i=0;i<13;i++)
		{
			boolean d=false;
			System.out.println(p[i]);
			ans=sc.next();
			if(ans.equals("yes"))
			{	count++;
				d=true;
			}
			if(count>=2)
			{
				flag=1;
				break;
			}
			if((p[i]*p[i])<100 && d)
			{
				System.out.println(p[i]*p[i]);
				ans=sc.next();
				if(ans.equals("yes"))
					count++;
			}
			if(count>=2)
			{
				flag=1;
				break;
			}
		}
		if(flag==0)
			System.out.println("prime");
		else
			System.out.println("composite");
		System.out.flush();
	}

}
class MyScannerbp
{
	BufferedReader br;
	StringTokenizer st;
	MyScannerbp()
	{
		br=new BufferedReader(new InputStreamReader(System.in));
	}
	String next()
	{

		while(st==null || !st.hasMoreTokens())
		{
			try
			{
				st=new StringTokenizer(br.readLine());
			}
			catch(Exception e)
			{
				e.printStackTrace();
			}
		}
		return st.nextToken();

	}
	int nextInt()
	{
		return Integer.parseInt(next());
	}
	long nextLong()
	{
		return Long.parseLong(next());
	}
	double nextDouble()
	{
		return Double.parseDouble(next());
	}
	String nextLine()
	{
		String str="";
		try
		{
			str=br.readLine();
		}
		catch(Exception e)
		{
			e.printStackTrace();
		}
		return str;

	}
}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

/**
 * Created with IntelliJ IDEA.
 * User: olymp
 * Date: 13.09.15
 * Time: 11:00
 * To change this template use File | Settings | File Templates.
 */
public class Test {
    static BufferedReader in = null;
    static PrintWriter out = null;
    static StringTokenizer st = new StringTokenizer("");

    public static void main(String[] args) {
        try {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
            solve();

            out.close();
            in.close();
        } catch (Exception e) {
            e.printStackTrace();
        }
    }

    public static String readString() {
        while (!st.hasMoreTokens()) {
            try {
                st = new StringTokenizer(in.readLine());
            } catch (Exception e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    public static int readInt() {
        return Integer.parseInt(readString());
    }

    public static long readLong() {
        return Long.parseLong(readString());
    }

    public static double readDouble() {
        return Double.parseDouble(readString());
    }

    public static class Pair implements Comparable<Pair> {
        public int x, y;

        public Pair(int x, int y) {
            this.x = x;
            this.y = y;
        }

        @Override
        public int compareTo(Pair o) {
            if (Integer.compare(this.x, o.x) != 0) return Integer.compare(this.x, o.x);
            else return Integer.compare(this.y, o.y);
        }
    }

    public static boolean isPrime(int x) {
        boolean prime = true;
        for (int i = 2; i * i <= x; i++) {
            if (x % i == 0) {
                prime = false;
                break;
            }
        }
        return prime;
    }

    public static long hash(char[] a) {
        long ans = 0;
        long pow = 31;
        for (int i = 0; i < a.length; i++) {
            ans += pow * a[i];
            pow *= 31;
        }
        return ans;
    }

    static void solve() throws IOException {
        int[] arr = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
        int count = 0;
        int used = 0;
        for (int i = 0; i < arr.length; i++) {
            out.println(arr[i]);
            out.flush();
            String s = readString();
            if (s.equals("yes")) {
                count++;
                used = arr[i];
            }
        }
        if (count > 1) {
            out.println("composite");
            out.flush();
            return;
        }
        if (count == 0) {
            out.println("prime");
            out.flush();
            return;
        }
        if (count == 1) {
            if(used*used>100){
                out.println("prime");
                out.flush();
                return;
            }
            out.println(used * used);
            out.flush();
            String s = readString();
            if (s.equals("yes")) {
                out.println("composite");
                out.flush();
                return;
            } else {
                out.println("prime");
                out.flush();
                return;
            }

        }
    }

}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

/**
 * Created with IntelliJ IDEA.
 * User: olymp
 * Date: 13.09.15
 * Time: 11:00
 * To change this template use File | Settings | File Templates.
 */
public class Test {
    static BufferedReader in = null;
    static PrintWriter out = null;
    static StringTokenizer st = new StringTokenizer("");

    public static void main(String[] args) {
        try {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
            solve();

            out.close();
            in.close();
        } catch (Exception e) {
            e.printStackTrace();
        }
    }

    public static String readString() {
        while (!st.hasMoreTokens()) {
            try {
                st = new StringTokenizer(in.readLine());
            } catch (Exception e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    public static int readInt() {
        return Integer.parseInt(readString());
    }

    public static long readLong() {
        return Long.parseLong(readString());
    }

    public static double readDouble() {
        return Double.parseDouble(readString());
    }

    public static class Pair implements Comparable<Pair> {
        public int x, y;

        public Pair(int x, int y) {
            this.x = x;
            this.y = y;
        }

        @Override
        public int compareTo(Pair o) {
            if (Integer.compare(this.x, o.x) != 0) return Integer.compare(this.x, o.x);
            else return Integer.compare(this.y, o.y);
        }
    }

    public static boolean isPrime(int x) {
        boolean prime = true;
        for (int i = 2; i * i <= x; i++) {
            if (x % i == 0) {
                prime = false;
                break;
            }
        }
        return prime;
    }

    public static long hash(char[] a) {
        long ans = 0;
        long pow = 31;
        for (int i = 0; i < a.length; i++) {
            ans += pow * a[i];
            pow *= 31;
        }
        return ans;
    }

    static void solve() throws IOException {
        int[] arr = {2, 3, 5, 7};
        int count = 0;
        int used = 0;
        for (int i = 0; i < 4; i++) {
            out.println(arr[i]);
            out.flush();
            String s = readString();
            if(s.equals("yes")){
                count++;
                used=arr[i];
            }
        }
        if(count>1){
            out.println("composite");
            out.flush();
            return;
        }
        if(count == 0){
            out.println("prime");
            out.flush();
            return;
        }
        if(count == 1){
            out.println(used*used);
            out.flush();
            String s = readString();
            if(s.equals("yes")){
                out.println("composite");
                out.flush();
                return;
            } else {
                out.println("prime");
                out.flush();
                return;
            }
        }

    }

}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

/**
 * Created with IntelliJ IDEA.
 * User: olymp
 * Date: 13.09.15
 * Time: 11:00
 * To change this template use File | Settings | File Templates.
 */
public class Test {
    static BufferedReader in = null;
    static PrintWriter out = null;
    static StringTokenizer st = new StringTokenizer("");

    public static void main(String[] args) {
        try {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
            solve();

            out.close();
            in.close();
        } catch (Exception e) {
            e.printStackTrace();
        }
    }

    public static String readString() {
        while (!st.hasMoreTokens()) {
            try {
                st = new StringTokenizer(in.readLine());
            } catch (Exception e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }

    public static int readInt() {
        return Integer.parseInt(readString());
    }

    public static long readLong() {
        return Long.parseLong(readString());
    }

    public static double readDouble() {
        return Double.parseDouble(readString());
    }

    public static class Pair implements Comparable<Pair> {
        public int x, y;

        public Pair(int x, int y) {
            this.x = x;
            this.y = y;
        }

        @Override
        public int compareTo(Pair o) {
            if (Integer.compare(this.x, o.x) != 0) return Integer.compare(this.x, o.x);
            else return Integer.compare(this.y, o.y);
        }
    }

    public static boolean isPrime(int x) {
        boolean prime = true;
        for (int i = 2; i * i <= x; i++) {
            if (x % i == 0) {
                prime = false;
                break;
            }
        }
        return prime;
    }

    public static long hash(char[] a) {
        long ans = 0;
        long pow = 31;
        for (int i = 0; i < a.length; i++) {
            ans += pow * a[i];
            pow *= 31;
        }
        return ans;
    }

    static void solve() throws IOException {
        int[] arr = {2, 3, 5, 7};
        int count = 0;
        int used = 0;
        for (int i = 0; i < 4; i++) {
            out.println(arr[i]);
            out.flush();
            String s = readString();
            if(s.equals("yes")){
                count++;
                used=arr[i];
            }
        }
        if(count>1){
            out.println("composite");
            out.flush();
            return;
        }
        if(count == 0){
            out.println("prime");
            out.flush();
            return;
        }
        if(count == 1){
            out.println(used*used);
            out.flush();
            String s = readString();
            if(s.equals("yes")){
                out.println("composite");
                out.flush();
                return;
            } else {
                out.println("composite");
                out.flush();
                return;
            }
        }

    }

}


import java.util.Scanner;

public class sortaretopo {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String replay;

		int v[] = new int[101];
		for (int i = 0 ; i <= 100; i++)
			v[i] = i;

		boolean divs[] = new boolean[4];
		int     divsnr[] = {2, 3, 5, 7};

		System.out.println(2);
		System.out.flush();
		replay = sc.next();

		if(replay.equals("yes"))
			divs[0] = true;

		System.out.println(3);
		System.out.flush();
		replay = sc.next();

		if(replay.equals("yes"))
			divs[1] = true;

		System.out.println(5);
		System.out.flush();
		replay = sc.next();

		if(replay.equals("yes"))
			divs[2] = true;

		System.out.println(7);
		System.out.flush();
		replay = sc.next();

		if(replay.equals("yes"))
			divs[3] = true;

		int nr = 0;
		for (int i = 0; i <= 3; i++)
			if (divs[i]) nr++;

		if (nr == 0) {
			System.out.println("prime");
			System.out.flush();
			return;
		}
		else if (nr > 1) {
			System.out.println("composite");
			System.out.flush();
			return;
		}

		for (int i = 0; i <= 3; i++)
			if (divs[i])
				nr = i;

		for (int i = 0; i <= 3; i++)
			for (int j = 2; j <= 100; j++)
				if (i == nr) continue;
				else if (v[j] % divsnr[i] == 0)
					v[j] = 0;

		for (int j = divsnr[nr]+1; j <= 100; j++)
			if (v[j] != 0 && v[j] % divsnr[nr] == 0) {
				System.out.println(v[j]);
				System.out.flush();
				replay = sc.next();

				if (replay.equals("yes")) {
					System.out.println("composite");
					System.out.flush();
					return;
				}

				for (int k = j; k <= 100; k++)
					if (k % j == 0) v[k] = 0;
			}

		System.out.println("prime");
		System.out.flush();
	}
}


import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.BitSet;
import java.util.Calendar;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.SortedSet;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

/**
 * #
 * @author pttrung
 */
public class C_Round_356_Div2 {

    public static long MOD = 1000000007;

    public static void main(String[] args) throws FileNotFoundException {
        // PrintWriter out = new PrintWriter(new FileOutputStream(new File(
        // "output.txt")));
        // PrintWriter out = new PrintWriter(System.out);
        Scanner in = new Scanner();
        ArrayList<Integer> p = new ArrayList();
        for (int i = 2; i < 50; i++) {
            if (isPrime(i)) {
                p.add(i);
            }
        }
       // System.out.println(p);
        int c = 0;
        for (int i = 0; i < p.size() && c <= 1; i++) {
            System.out.println(p.get(i));
            System.out.flush();
            String v = in.next();
            if (v.equals("yes")) {
                c++;
                if (c <= 1 && p.get(i)*p.get(i) <= 100) {
                    System.out.println(p.get(i) * p.get(i));
                    System.out.flush();
                    v = in.next();
                    if (v.equals("yes")) {
                        c++;
                    }
                }
            }

        }
        if (c > 1) {
            System.out.println("composite");
        } else {
            System.out.println("prime");
        }

        //out.close();
    }

    static boolean isPrime(int v) {
        for (int i = 2; i * i <= v; i++) {
            if (v % i == 0) {
                return false;
            }
        }
        return true;
    }

    public static int[] KMP(String val) {
        int i = 0;
        int j = -1;
        int[] result = new int[val.length() + 1];
        result[0] = -1;
        while (i < val.length()) {
            while (j >= 0 && val.charAt(j) != val.charAt(i)) {
                j = result[j];
            }
            j++;
            i++;
            result[i] = j;
        }
        return result;

    }

    public static boolean nextPer(int[] data) {
        int i = data.length - 1;
        while (i > 0 && data[i] < data[i - 1]) {
            i--;
        }
        if (i == 0) {
            return false;
        }
        int j = data.length - 1;
        while (data[j] < data[i - 1]) {
            j--;
        }
        int temp = data[i - 1];
        data[i - 1] = data[j];
        data[j] = temp;
        Arrays.sort(data, i, data.length);
        return true;
    }

    public static int digit(long n) {
        int result = 0;
        while (n > 0) {
            n /= 10;
            result++;
        }
        return result;
    }

    public static double dist(long a, long b, long x, long y) {
        double val = (b - a) * (b - a) + (x - y) * (x - y);
        val = Math.sqrt(val);
        double other = x * x + a * a;
        other = Math.sqrt(other);
        return val + other;

    }

    public static class Point implements Comparable<Point> {

        int x, y;

        public Point(int start, int end) {
            this.x = start;
            this.y = end;
        }

        @Override
        public int hashCode() {
            int hash = 5;
            hash = 47 * hash + this.x;
            hash = 47 * hash + this.y;
            return hash;
        }

        @Override
        public boolean equals(Object obj) {
            if (obj == null) {
                return false;
            }
            if (getClass() != obj.getClass()) {
                return false;
            }
            final Point other = (Point) obj;
            if (this.x != other.x) {
                return false;
            }
            if (this.y != other.y) {
                return false;
            }
            return true;
        }

        @Override
        public int compareTo(Point o) {
            return Integer.compare(x, o.x);
        }
    }

    public static class FT {

        long[] data;

        FT(int n) {
            data = new long[n];
        }

        public void update(int index, long value) {
            while (index < data.length) {
                data[index] += value;
                index += (index & (-index));
            }
        }

        public long get(int index) {
            long result = 0;
            while (index > 0) {
                result += data[index];
                index -= (index & (-index));
            }
            return result;

        }
    }

    public static long gcd(long a, long b) {
        if (b == 0) {
            return a;
        }
        return gcd(b, a % b);
    }

    public static long pow(long a, long b, long MOD) {
        if (b == 0) {
            return 1;
        }
        if (b == 1) {
            return a;
        }
        long val = pow(a, b / 2, MOD);
        if (b % 2 == 0) {
            return val * val % MOD;
        } else {
            return val * (val * a % MOD) % MOD;

        }
    }

    static class Scanner {

        BufferedReader br;
        StringTokenizer st;

        public Scanner() throws FileNotFoundException {
            // System.setOut(new PrintStream(new BufferedOutputStream(System.out), true));
            br = new BufferedReader(new InputStreamReader(System.in));
            //  br = new BufferedReader(new InputStreamReader(new FileInputStream(new File("input.txt"))));
        }

        public String next() {

            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                    throw new RuntimeException();
                }
            }
            return st.nextToken();
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }

        public String nextLine() {
            st = null;
            try {
                return br.readLine();
            } catch (Exception e) {
                throw new RuntimeException();
            }
        }

        public boolean endLine() {
            try {
                String next = br.readLine();
                while (next != null && next.trim().isEmpty()) {
                    next = br.readLine();
                }
                if (next == null) {
                    return true;
                }
                st = new StringTokenizer(next);
                return st.hasMoreTokens();
            } catch (Exception e) {
                throw new RuntimeException();
            }
        }
    }
}


import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.BitSet;
import java.util.Calendar;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.SortedSet;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

/**
 * #
 * @author pttrung
 */
public class C_Round_356_Div2 {

    public static long MOD = 1000000007;

    public static void main(String[] args) throws FileNotFoundException {
        // PrintWriter out = new PrintWriter(new FileOutputStream(new File(
        // "output.txt")));
       // PrintWriter out = new PrintWriter(System.out);
        Scanner in = new Scanner();
        ArrayList<Integer> p = new ArrayList();
        for(int i = 2; i < 100; i++){
            if(isPrime(i)){
                p.add(i);
            }
        }
        System.out.println(p.size());
        int c = 0 ;
        for(int i = 0; i < p.size(); i++){
            System.out.println(p.get(i));
            System.out.flush();
            String v = in.next();
            if(v.equals("yes")){
                c++;
            }
            System.out.println(p.get(i)*p.get(i));
            System.out.flush();
            v = in.next();
            if(v.equals("yes")){
                c++;
            }
        }
        if(c > 1){
            System.out.println("composite");
        }else{
            System.out.println("prime");
        }

        //out.close();
    }

    static boolean isPrime(int v){
        for(int i = 2; i*i <= v; i++){
            if(v % i == 0){
                return false;
            }
        }
        return true;
    }

    public static int[] KMP(String val) {
        int i = 0;
        int j = -1;
        int[] result = new int[val.length() + 1];
        result[0] = -1;
        while (i < val.length()) {
            while (j >= 0 && val.charAt(j) != val.charAt(i)) {
                j = result[j];
            }
            j++;
            i++;
            result[i] = j;
        }
        return result;

    }

    public static boolean nextPer(int[] data) {
        int i = data.length - 1;
        while (i > 0 && data[i] < data[i - 1]) {
            i--;
        }
        if (i == 0) {
            return false;
        }
        int j = data.length - 1;
        while (data[j] < data[i - 1]) {
            j--;
        }
        int temp = data[i - 1];
        data[i - 1] = data[j];
        data[j] = temp;
        Arrays.sort(data, i, data.length);
        return true;
    }

    public static int digit(long n) {
        int result = 0;
        while (n > 0) {
            n /= 10;
            result++;
        }
        return result;
    }

    public static double dist(long a, long b, long x, long y) {
        double val = (b - a) * (b - a) + (x - y) * (x - y);
        val = Math.sqrt(val);
        double other = x * x + a * a;
        other = Math.sqrt(other);
        return val + other;

    }

    public static class Point implements Comparable<Point> {

        int x, y;

        public Point(int start, int end) {
            this.x = start;
            this.y = end;
        }

        @Override
        public int hashCode() {
            int hash = 5;
            hash = 47 * hash + this.x;
            hash = 47 * hash + this.y;
            return hash;
        }

        @Override
        public boolean equals(Object obj) {
            if (obj == null) {
                return false;
            }
            if (getClass() != obj.getClass()) {
                return false;
            }
            final Point other = (Point) obj;
            if (this.x != other.x) {
                return false;
            }
            if (this.y != other.y) {
                return false;
            }
            return true;
        }

        @Override
        public int compareTo(Point o) {
            return Integer.compare(x, o.x);
        }
    }

    public static class FT {

        long[] data;

        FT(int n) {
            data = new long[n];
        }

        public void update(int index, long value) {
            while (index < data.length) {
                data[index] += value;
                index += (index & (-index));
            }
        }

        public long get(int index) {
            long result = 0;
            while (index > 0) {
                result += data[index];
                index -= (index & (-index));
            }
            return result;

        }
    }

    public static long gcd(long a, long b) {
        if (b == 0) {
            return a;
        }
        return gcd(b, a % b);
    }

    public static long pow(long a, long b, long MOD) {
        if (b == 0) {
            return 1;
        }
        if (b == 1) {
            return a;
        }
        long val = pow(a, b / 2, MOD);
        if (b % 2 == 0) {
            return val * val % MOD;
        } else {
            return val * (val * a % MOD) % MOD;

        }
    }

    static class Scanner {

        BufferedReader br;
        StringTokenizer st;

        public Scanner() throws FileNotFoundException {
            // System.setOut(new PrintStream(new BufferedOutputStream(System.out), true));
            br = new BufferedReader(new InputStreamReader(System.in));
            //  br = new BufferedReader(new InputStreamReader(new FileInputStream(new File("input.txt"))));
        }

        public String next() {

            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                    throw new RuntimeException();
                }
            }
            return st.nextToken();
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }

        public String nextLine() {
            st = null;
            try {
                return br.readLine();
            } catch (Exception e) {
                throw new RuntimeException();
            }
        }

        public boolean endLine() {
            try {
                String next = br.readLine();
                while (next != null && next.trim().isEmpty()) {
                    next = br.readLine();
                }
                if (next == null) {
                    return true;
                }
                st = new StringTokenizer(next);
                return st.hasMoreTokens();
            } catch (Exception e) {
                throw new RuntimeException();
            }
        }
    }
}


import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.BitSet;
import java.util.Calendar;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.SortedSet;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

/**
 * #
 * @author pttrung
 */
public class C_Round_356_Div2 {

    public static long MOD = 1000000007;

    public static void main(String[] args) throws FileNotFoundException {
        // PrintWriter out = new PrintWriter(new FileOutputStream(new File(
        // "output.txt")));
       // PrintWriter out = new PrintWriter(System.out);
        Scanner in = new Scanner();
        ArrayList<Integer> p = new ArrayList();
        for(int i = 2; i < 100; i++){
            if(isPrime(i)){
                p.add(i);
            }
        }
        //System.out.println(p.size());
        int c = 0 ;
        for(int i = 0; i < p.size(); i++){
            System.out.println(p.get(i));
            System.out.flush();
            String v = in.next();
            if(v.equals("yes")){
                c++;
            }
            System.out.println(p.get(i)*p.get(i));
            System.out.flush();
            v = in.next();
            if(v.equals("yes")){
                c++;
            }
        }
        if(c > 1){
            System.out.println("composite");
        }else{
            System.out.println("prime");
        }

        //out.close();
    }

    static boolean isPrime(int v){
        for(int i = 2; i*i <= v; i++){
            if(v % i == 0){
                return false;
            }
        }
        return true;
    }

    public static int[] KMP(String val) {
        int i = 0;
        int j = -1;
        int[] result = new int[val.length() + 1];
        result[0] = -1;
        while (i < val.length()) {
            while (j >= 0 && val.charAt(j) != val.charAt(i)) {
                j = result[j];
            }
            j++;
            i++;
            result[i] = j;
        }
        return result;

    }

    public static boolean nextPer(int[] data) {
        int i = data.length - 1;
        while (i > 0 && data[i] < data[i - 1]) {
            i--;
        }
        if (i == 0) {
            return false;
        }
        int j = data.length - 1;
        while (data[j] < data[i - 1]) {
            j--;
        }
        int temp = data[i - 1];
        data[i - 1] = data[j];
        data[j] = temp;
        Arrays.sort(data, i, data.length);
        return true;
    }

    public static int digit(long n) {
        int result = 0;
        while (n > 0) {
            n /= 10;
            result++;
        }
        return result;
    }

    public static double dist(long a, long b, long x, long y) {
        double val = (b - a) * (b - a) + (x - y) * (x - y);
        val = Math.sqrt(val);
        double other = x * x + a * a;
        other = Math.sqrt(other);
        return val + other;

    }

    public static class Point implements Comparable<Point> {

        int x, y;

        public Point(int start, int end) {
            this.x = start;
            this.y = end;
        }

        @Override
        public int hashCode() {
            int hash = 5;
            hash = 47 * hash + this.x;
            hash = 47 * hash + this.y;
            return hash;
        }

        @Override
        public boolean equals(Object obj) {
            if (obj == null) {
                return false;
            }
            if (getClass() != obj.getClass()) {
                return false;
            }
            final Point other = (Point) obj;
            if (this.x != other.x) {
                return false;
            }
            if (this.y != other.y) {
                return false;
            }
            return true;
        }

        @Override
        public int compareTo(Point o) {
            return Integer.compare(x, o.x);
        }
    }

    public static class FT {

        long[] data;

        FT(int n) {
            data = new long[n];
        }

        public void update(int index, long value) {
            while (index < data.length) {
                data[index] += value;
                index += (index & (-index));
            }
        }

        public long get(int index) {
            long result = 0;
            while (index > 0) {
                result += data[index];
                index -= (index & (-index));
            }
            return result;

        }
    }

    public static long gcd(long a, long b) {
        if (b == 0) {
            return a;
        }
        return gcd(b, a % b);
    }

    public static long pow(long a, long b, long MOD) {
        if (b == 0) {
            return 1;
        }
        if (b == 1) {
            return a;
        }
        long val = pow(a, b / 2, MOD);
        if (b % 2 == 0) {
            return val * val % MOD;
        } else {
            return val * (val * a % MOD) % MOD;

        }
    }

    static class Scanner {

        BufferedReader br;
        StringTokenizer st;

        public Scanner() throws FileNotFoundException {
            // System.setOut(new PrintStream(new BufferedOutputStream(System.out), true));
            br = new BufferedReader(new InputStreamReader(System.in));
            //  br = new BufferedReader(new InputStreamReader(new FileInputStream(new File("input.txt"))));
        }

        public String next() {

            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                    throw new RuntimeException();
                }
            }
            return st.nextToken();
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }

        public String nextLine() {
            st = null;
            try {
                return br.readLine();
            } catch (Exception e) {
                throw new RuntimeException();
            }
        }

        public boolean endLine() {
            try {
                String next = br.readLine();
                while (next != null && next.trim().isEmpty()) {
                    next = br.readLine();
                }
                if (next == null) {
                    return true;
                }
                st = new StringTokenizer(next);
                return st.hasMoreTokens();
            } catch (Exception e) {
                throw new RuntimeException();
            }
        }
    }
}


import java.util.*;
import java.io.*;
import java.math.*;

public class Main{

    public static double s(int ax, int ay, int bx, int by, int cx, int cy) {
        double d = Math.abs(ax * (by - cy) + bx * (cy - ay) + cx * (ay - by)) / 2.0;
        return d;
    }

    public static void main(String[] args){
        try{

//            Scanner in = new Scanner(new File("C:\\Users\\VisionLab\\Downloads\\caffe-windows\\caffe-windows\\data\\aesthetics\\test.jpgl"));
//            Scanner ava = new Scanner(new File("C:\\Users\\VisionLab\\Downloads\\caffe-windows\\caffe-windows\\data\\aesthetics\\sorted AVA.txt"));
//            PrintWriter out = new PrintWriter(new File("C:\\Users\\VisionLab\\Downloads\\caffe-windows\\caffe-windows\\data\\aesthetics\\test.txt"));
//
//            int length = 255530;
//
//            int[][] a = new int[length][3];
//            double[] d = new double[length];
//            int[] s = new int[length];
//
//            int threshold = 5;
//            double delta = 0;
//
//            for (int j = 0; j < length; j++) {
//                a[j][0] = ava.nextInt();
//                d[j] = ava.nextDouble();
//                a[j][1] = ava.nextInt();
//                a[j][2] = ava.nextInt();
//                if (d[j] <= threshold - delta) {
//                    s[j] = 0;
//                } else if (d[j] > threshold + delta) {
//                    s[j] = 1;
//                } else {
//                    s[j] = -1;
//                }
//            }
//
//            for (int i = 0; i < 20000; i++) {
//                int id = in.nextInt();
//                for (int j = 0; j < length; j++) {
//                    if (a[j][0] == id) {
//                        if (s[j] != -1) {
//                            System.out.println(i);
//                            out.println("/data/aesthetics/images/" + Integer.toString(a[j][0]) + ".jpg " + s[j]);
//                        }
//                        break;
//                    }
//                }
//            }
//
//            in.close();
//            out.close();
//            ava.close();

            Scanner in = new Scanner(System.in);

            String s;

            int a[] = {2, 3, 4, 5, 6, 7, 8, 9, 10};
            int c = 0;

            for (int i = 0; i < a.length; i++) {
                System.out.println(a[i]);
                System.out.flush();

                s = in.next();

                if (s.equals("yes")) {
                    c++;
                    if (c >= 2) {
                        System.out.println("composite");
                        System.out.flush();
                        return;
                    }
                }
            }

            System.out.println("prime");
            System.out.flush();

        } catch(Exception ex) {
            System.out.println(ex.toString());
        }
   }
}


import java.util.*;
import java.io.*;
import java.math.*;

public class Main{

    public static double s(int ax, int ay, int bx, int by, int cx, int cy) {
        double d = Math.abs(ax * (by - cy) + bx * (cy - ay) + cx * (ay - by)) / 2.0;
        return d;
    }

    public static void main(String[] args){
        try{

//            Scanner in = new Scanner(new File("C:\\Users\\VisionLab\\Downloads\\caffe-windows\\caffe-windows\\data\\aesthetics\\test.jpgl"));
//            Scanner ava = new Scanner(new File("C:\\Users\\VisionLab\\Downloads\\caffe-windows\\caffe-windows\\data\\aesthetics\\sorted AVA.txt"));
//            PrintWriter out = new PrintWriter(new File("C:\\Users\\VisionLab\\Downloads\\caffe-windows\\caffe-windows\\data\\aesthetics\\test.txt"));
//
//            int length = 255530;
//
//            int[][] a = new int[length][3];
//            double[] d = new double[length];
//            int[] s = new int[length];
//
//            int threshold = 5;
//            double delta = 0;
//
//            for (int j = 0; j < length; j++) {
//                a[j][0] = ava.nextInt();
//                d[j] = ava.nextDouble();
//                a[j][1] = ava.nextInt();
//                a[j][2] = ava.nextInt();
//                if (d[j] <= threshold - delta) {
//                    s[j] = 0;
//                } else if (d[j] > threshold + delta) {
//                    s[j] = 1;
//                } else {
//                    s[j] = -1;
//                }
//            }
//
//            for (int i = 0; i < 20000; i++) {
//                int id = in.nextInt();
//                for (int j = 0; j < length; j++) {
//                    if (a[j][0] == id) {
//                        if (s[j] != -1) {
//                            System.out.println(i);
//                            out.println("/data/aesthetics/images/" + Integer.toString(a[j][0]) + ".jpg " + s[j]);
//                        }
//                        break;
//                    }
//                }
//            }
//
//            in.close();
//            out.close();
//            ava.close();

            Scanner in = new Scanner(System.in);

            String s;

            int a[] = {2, 3, 4, 5, 7, 9, 11, 13, 17, 19, 23, 25, 29, 31, 37, 41, 43, 47, 49, 53};
            int c = 0, l = 0;

            for (int i = 0; i < a.length; i++) {
                System.out.println(a[i]);
                System.out.flush();
                l++;

                s = in.next();

                if (s.equals("yes")) {
                    c++;
                    if (c >= 2) {
                        System.out.println("composite");
                        System.out.flush();
                        return;
                    }
                }
            }

            System.out.println("prime");
            System.out.flush();

        } catch(Exception ex) {
            System.out.println(ex.toString());
        }
   }
}


/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

/**
 *
 * @author hartha
 */
public class CodeForces {

    static ArrayList<Edge> g[];

    public static void main(String[] args) throws IOException {
        Reader.init(System.in);
        //Reader.init(new FileReader("input.txt"));
        PrintWriter writer = new PrintWriter(System.out);
        writer.println(2);
        writer.flush();
        int c = 0, x = 0;
        if (Reader.next().equals("yes")) {
            c++;
            x = 2;
        }
        writer.println(3);
        writer.flush();

        if (Reader.next().equals("yes")) {
            c++;
            x = 3;
        }
        writer.println(5);
        writer.flush();

        if (Reader.next().equals("yes")) {
            c++;
            x = 5;
        }
        writer.println(7);
        writer.flush();

        if (Reader.next().equals("yes")) {
            c++;
            x = 7;
        }

       if(c == 1){
           writer.println(x * 2);
           writer.flush();

           if(Reader.next().equals("yes"))
               writer.println("composite");
           else
               writer.println("prime");
       }

       else
           writer.println("composite");

        writer.close();
    }

}

class Edge implements Comparable<Edge> {

    int dis, cost;

    public Edge(int dis, int cost) {
        this.dis = dis;
        this.cost = cost;
    }

    @Override
    public int compareTo(Edge o) {
        return this.cost - o.cost;
    }

}

class Reader {

    static BufferedReader reader;
    static StringTokenizer tokenizer;

    public static int pars(String x) {
        int num = 0;
        int i = 0;
        if (x.charAt(0) == '-') {
            i = 1;
        }
        for (; i < x.length(); i++) {
            num = num * 10 + (x.charAt(i) - '0');
        }

        if (x.charAt(0) == '-') {
            return -num;
        }

        return num;
    }

    static void init(InputStream input) {
        reader = new BufferedReader(
                new InputStreamReader(input));
        tokenizer = new StringTokenizer("");
    }

    static void init(FileReader input) {
        reader = new BufferedReader(input);
        tokenizer = new StringTokenizer("");
    }

    static String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(
                    reader.readLine());
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return pars(next());
    }

    static long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }
}


/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

/**
 *
 * @author hartha
 */
public class CodeForces {

    static ArrayList<Edge> g[];

    public static void main(String[] args) throws IOException {
        Reader.init(System.in);
        //Reader.init(new FileReader("input.txt"));
        PrintWriter writer = new PrintWriter(System.out);
        writer.println(2);
        writer.flush();
        int c = 0, x = 0;
        if (Reader.next().equals("yes")) {
            c++;
            x = 2;
        }
        writer.println(3);
        writer.flush();

        if (Reader.next().equals("yes")) {
            c++;
            x = 3;
        }
        writer.println(5);
        writer.flush();

        if (Reader.next().equals("yes")) {
            c++;
            x = 5;
        }
        writer.println(7);
        writer.flush();

        if (Reader.next().equals("yes")) {
            c++;
            x = 7;
        }

        if (c == 0) {
            writer.println("prime");
        } else if (c == 1) {
            for (int i = 1; i <= 16; i++) {
                writer.println(x * (2 + i));
                writer.flush();

                if (Reader.next().equals("yes")) {
                    writer.println("composite");
                    writer.close();
                    return;
                }
            }
        } else {
            writer.println("composite");
            writer.close();
            return;
        }
        writer.println("prime");
        writer.close();
    }

}

class Edge implements Comparable<Edge> {

    int dis, cost;

    public Edge(int dis, int cost) {
        this.dis = dis;
        this.cost = cost;
    }

    @Override
    public int compareTo(Edge o) {
        return this.cost - o.cost;
    }

}

class Reader {

    static BufferedReader reader;
    static StringTokenizer tokenizer;

    public static int pars(String x) {
        int num = 0;
        int i = 0;
        if (x.charAt(0) == '-') {
            i = 1;
        }
        for (; i < x.length(); i++) {
            num = num * 10 + (x.charAt(i) - '0');
        }

        if (x.charAt(0) == '-') {
            return -num;
        }

        return num;
    }

    static void init(InputStream input) {
        reader = new BufferedReader(
                new InputStreamReader(input));
        tokenizer = new StringTokenizer("");
    }

    static void init(FileReader input) {
        reader = new BufferedReader(input);
        tokenizer = new StringTokenizer("");
    }

    static String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(
                    reader.readLine());
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return pars(next());
    }

    static long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }
}


/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

/**
 *
 * @author hartha
 */
public class CodeForces {

    static ArrayList<Edge> g[];

    public static void main(String[] args) throws IOException {
        Reader.init(System.in);
        //Reader.init(new FileReader("input.txt"));
        PrintWriter writer = new PrintWriter(System.out);
        writer.println(2);
        writer.flush();

        if (Reader.next().equals("yes")) {
            writer.println("composite");
            writer.flush();

        }
        writer.println(3);
        writer.flush();

        if (Reader.next().equals("yes")) {
            writer.println("composite");
            writer.flush();

        }
        writer.println(5);
        writer.flush();

        if (Reader.next().equals("yes")) {
            writer.println("composite");
            writer.flush();

        }
        writer.println(7);
        writer.flush();

        if (Reader.next().equals("yes")) {
            writer.println("composite");
            writer.flush();

        } else {
            writer.println("prime");
        }

        writer.flush();
    }

}

class Edge implements Comparable<Edge> {

    int dis, cost;

    public Edge(int dis, int cost) {
        this.dis = dis;
        this.cost = cost;
    }

    @Override
    public int compareTo(Edge o) {
        return this.cost - o.cost;
    }

}

class Reader {

    static BufferedReader reader;
    static StringTokenizer tokenizer;

    public static int pars(String x) {
        int num = 0;
        int i = 0;
        if (x.charAt(0) == '-') {
            i = 1;
        }
        for (; i < x.length(); i++) {
            num = num * 10 + (x.charAt(i) - '0');
        }

        if (x.charAt(0) == '-') {
            return -num;
        }

        return num;
    }

    static void init(InputStream input) {
        reader = new BufferedReader(
                new InputStreamReader(input));
        tokenizer = new StringTokenizer("");
    }

    static void init(FileReader input) {
        reader = new BufferedReader(input);
        tokenizer = new StringTokenizer("");
    }

    static String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(
                    reader.readLine());
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return pars(next());
    }

    static long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }
}


/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

/**
 *
 * @author hartha
 */
public class CodeForces {

    static ArrayList<Edge> g[];

    public static void main(String[] args) throws IOException {
        Reader.init(System.in);
        //Reader.init(new FileReader("input.txt"));
        PrintWriter writer = new PrintWriter(System.out);

        int arr[] = {2,3,5,7,11};
        int num = -1, counter = 0;

        for (int i = 0; i < 4; i++) {
            writer.println(arr[i]);
            writer.flush();

            if(Reader.next().equals("yes")){
                num = i;
                counter++;
            }
        }

        if(counter == 0)
            writer.println("prime");

        else if(counter == 1){
            int first = arr[num] + 1, last = arr[num+1] * 2;

            while(first <= last){
                int mid = (first + last) / 2;

                writer.println("mid");
                writer.flush();

                if(Reader.next().equals("yes")){
                    writer.println("composite");
                    writer.close();
                    return;
                }
            }

            writer.println("prime");
        }

        else
            writer.println("composite");

        writer.close();
        writer.close();
    }

}

class Edge implements Comparable<Edge> {

    int dis, cost;

    public Edge(int dis, int cost) {
        this.dis = dis;
        this.cost = cost;
    }

    @Override
    public int compareTo(Edge o) {
        return this.cost - o.cost;
    }

}

class Reader {

    static BufferedReader reader;
    static StringTokenizer tokenizer;

    public static int pars(String x) {
        int num = 0;
        int i = 0;
        if (x.charAt(0) == '-') {
            i = 1;
        }
        for (; i < x.length(); i++) {
            num = num * 10 + (x.charAt(i) - '0');
        }

        if (x.charAt(0) == '-') {
            return -num;
        }

        return num;
    }

    static void init(InputStream input) {
        reader = new BufferedReader(
                new InputStreamReader(input));
        tokenizer = new StringTokenizer("");
    }

    static void init(FileReader input) {
        reader = new BufferedReader(input);
        tokenizer = new StringTokenizer("");
    }

    static String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(
                    reader.readLine());
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return pars(next());
    }

    static long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }
}


/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

/**
 *
 * @author hartha
 */
public class CodeForces {

    static ArrayList<Edge> g[];

    public static void main(String[] args) throws IOException {
        Reader.init(System.in);
        //Reader.init(new FileReader("input.txt"));
        PrintWriter writer = new PrintWriter(System.out);
        int first = 2, last = 100 ,c = 0;
        int counter = 0;
        while (first <= last) {
            int mid = (first + last) / 2;

            counter++;
            writer.println(mid);
            writer.flush();

            String s = Reader.next();

            if(s.equals("yes")){
                c++;
                first = mid + 1;
            }

            else
                last = mid - 1;

            if(c > 1 || counter == 20)
                break;

        }

        if(c > 1)
            writer.print("composite");
        else
            writer.println("prime");

        writer.close();
    }

}

class Edge implements Comparable<Edge> {

    int dis, cost;

    public Edge(int dis, int cost) {
        this.dis = dis;
        this.cost = cost;
    }

    @Override
    public int compareTo(Edge o) {
        return this.cost - o.cost;
    }

}

class Reader {

    static BufferedReader reader;
    static StringTokenizer tokenizer;

    public static int pars(String x) {
        int num = 0;
        int i = 0;
        if (x.charAt(0) == '-') {
            i = 1;
        }
        for (; i < x.length(); i++) {
            num = num * 10 + (x.charAt(i) - '0');
        }

        if (x.charAt(0) == '-') {
            return -num;
        }

        return num;
    }

    static void init(InputStream input) {
        reader = new BufferedReader(
                new InputStreamReader(input));
        tokenizer = new StringTokenizer("");
    }

    static void init(FileReader input) {
        reader = new BufferedReader(input);
        tokenizer = new StringTokenizer("");
    }

    static String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(
                    reader.readLine());
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return pars(next());
    }

    static long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }
}


/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

/**
 *
 * @author hartha
 */
public class CodeForces {

    static ArrayList<Edge> g[];

    public static void main(String[] args) throws IOException {
        Reader.init(System.in);
        //Reader.init(new FileReader("input.txt"));
        PrintWriter writer = new PrintWriter(System.out);

        int arr[] = {2,3,5,7};
        int num = -1, counter = 0;

        for (int i = 0; i < 4; i++) {
            writer.println(arr[i]);
            writer.flush();

            if(Reader.next().equals("yes")){
                num = arr[i];
                counter++;
            }
        }

        if(counter == 0)
            writer.println("prime");

        else if(counter == 1){
            for (int i = 0; i < 16; i++) {
                writer.println(num * (2 + i));
                writer.flush();

                if(Reader.next().equals("yes")){
                    writer.println("composite");
                    writer.close();
                    return;
                }
            }

            writer.println("prime");
        }

        else
            writer.println("composite");

        writer.close();
        writer.close();
    }

}

class Edge implements Comparable<Edge> {

    int dis, cost;

    public Edge(int dis, int cost) {
        this.dis = dis;
        this.cost = cost;
    }

    @Override
    public int compareTo(Edge o) {
        return this.cost - o.cost;
    }

}

class Reader {

    static BufferedReader reader;
    static StringTokenizer tokenizer;

    public static int pars(String x) {
        int num = 0;
        int i = 0;
        if (x.charAt(0) == '-') {
            i = 1;
        }
        for (; i < x.length(); i++) {
            num = num * 10 + (x.charAt(i) - '0');
        }

        if (x.charAt(0) == '-') {
            return -num;
        }

        return num;
    }

    static void init(InputStream input) {
        reader = new BufferedReader(
                new InputStreamReader(input));
        tokenizer = new StringTokenizer("");
    }

    static void init(FileReader input) {
        reader = new BufferedReader(input);
        tokenizer = new StringTokenizer("");
    }

    static String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(
                    reader.readLine());
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return pars(next());
    }

    static long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }
}


/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

/**
 *
 * @author hartha
 */
public class CodeForces {

    static ArrayList<Edge> g[];

    public static void main(String[] args) throws IOException {
        Reader.init(System.in);
        //Reader.init(new FileReader("input.txt"));
        PrintWriter writer = new PrintWriter(System.out);
        writer.println(2);
        writer.flush();
        int c = 0, x = 0;
        if (Reader.next().equals("yes")) {
            c++;
            x = 2;
        }
        writer.println(3);
        writer.flush();

        if (Reader.next().equals("yes")) {
            c++;
            x = 3;
        }
        writer.println(5);
        writer.flush();

        if (Reader.next().equals("yes")) {
            c++;
            x = 5;
        }
        writer.println(7);
        writer.flush();

        if (Reader.next().equals("yes")) {
            c++;
            x = 7;
        }

        if (c == 0) {
            writer.println("prime");
        } else if (c == 1) {
            for (int i = 1; i <= 16; i++) {
                writer.println(x * (2 + i));
                writer.flush();

                if (Reader.next().equals("yes")) {
                    writer.println("composite");
                } else {
                    writer.println("prime");
                }
            }
        } else {
            writer.println("composite");
        }

        writer.close();
    }

}

class Edge implements Comparable<Edge> {

    int dis, cost;

    public Edge(int dis, int cost) {
        this.dis = dis;
        this.cost = cost;
    }

    @Override
    public int compareTo(Edge o) {
        return this.cost - o.cost;
    }

}

class Reader {

    static BufferedReader reader;
    static StringTokenizer tokenizer;

    public static int pars(String x) {
        int num = 0;
        int i = 0;
        if (x.charAt(0) == '-') {
            i = 1;
        }
        for (; i < x.length(); i++) {
            num = num * 10 + (x.charAt(i) - '0');
        }

        if (x.charAt(0) == '-') {
            return -num;
        }

        return num;
    }

    static void init(InputStream input) {
        reader = new BufferedReader(
                new InputStreamReader(input));
        tokenizer = new StringTokenizer("");
    }

    static void init(FileReader input) {
        reader = new BufferedReader(input);
        tokenizer = new StringTokenizer("");
    }

    static String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(
                    reader.readLine());
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return pars(next());
    }

    static long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }
}


/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

/**
 *
 * @author hartha
 */
public class CodeForces {

    static ArrayList<Edge> g[];

    public static void main(String[] args) throws IOException {
        Reader.init(System.in);
        //Reader.init(new FileReader("input.txt"));
        PrintWriter writer = new PrintWriter(System.out);
        writer.println(2);
        writer.flush();
        int c = 0, x = 0;
        if (Reader.next().equals("yes")) {
            c++;
            x = 2;
        }
        writer.println(3);
        writer.flush();

        if (Reader.next().equals("yes")) {
            c++;
            x = 3;
        }
        writer.println(5);
        writer.flush();

        if (Reader.next().equals("yes")) {
            c++;
            x = 5;
        }
        writer.println(7);
        writer.flush();

        if (Reader.next().equals("yes")) {
            c++;
            x = 7;
        }

        if (c == 0) {
            writer.println("prime");
        } else if (c == 1) {
            for (int i = 1; i <= 16; i++) {
                writer.println(x * (2 + i));
                writer.flush();

                if (Reader.next().equals("yes")) {
                    writer.println("composite");
                    return;
                }
            }
        } else {
            writer.println("composite");
        }
        writer.println("prime");
        writer.close();
    }

}

class Edge implements Comparable<Edge> {

    int dis, cost;

    public Edge(int dis, int cost) {
        this.dis = dis;
        this.cost = cost;
    }

    @Override
    public int compareTo(Edge o) {
        return this.cost - o.cost;
    }

}

class Reader {

    static BufferedReader reader;
    static StringTokenizer tokenizer;

    public static int pars(String x) {
        int num = 0;
        int i = 0;
        if (x.charAt(0) == '-') {
            i = 1;
        }
        for (; i < x.length(); i++) {
            num = num * 10 + (x.charAt(i) - '0');
        }

        if (x.charAt(0) == '-') {
            return -num;
        }

        return num;
    }

    static void init(InputStream input) {
        reader = new BufferedReader(
                new InputStreamReader(input));
        tokenizer = new StringTokenizer("");
    }

    static void init(FileReader input) {
        reader = new BufferedReader(input);
        tokenizer = new StringTokenizer("");
    }

    static String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(
                    reader.readLine());
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return pars(next());
    }

    static long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }
}


/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

/**
 *
 * @author hartha
 */
public class CodeForces {

    static ArrayList<Edge> g[];

    public static void main(String[] args) throws IOException {
        Reader.init(System.in);
        //Reader.init(new FileReader("input.txt"));
        PrintWriter writer = new PrintWriter(System.out);
        writer.println(2);
        writer.flush();
        int c = 0, x = 0;
        if (Reader.next().equals("yes")) {
            c++;
            x = 2;
        }
        writer.println(3);
        writer.flush();

        if (Reader.next().equals("yes")) {
            c++;
            x = 3;
        }
        writer.println(5);
        writer.flush();

        if (Reader.next().equals("yes")) {
            c++;
            x = 5;
        }
        writer.println(7);
        writer.flush();

        if (Reader.next().equals("yes")) {
            c++;
            x = 7;
        }

        if (c == 0) {
            writer.println("prime");
        } else if (c == 1) {
            for (int i = 1; i <= 16; i++) {
                writer.println(x * (2 + i));
                writer.flush();

                if (Reader.next().equals("yes")) {
                    writer.println("composite");
                    writer.close();
                    return;
                }
            }
        } else {
            writer.println("composite");
        }
        writer.println("prime");
        writer.close();
    }

}

class Edge implements Comparable<Edge> {

    int dis, cost;

    public Edge(int dis, int cost) {
        this.dis = dis;
        this.cost = cost;
    }

    @Override
    public int compareTo(Edge o) {
        return this.cost - o.cost;
    }

}

class Reader {

    static BufferedReader reader;
    static StringTokenizer tokenizer;

    public static int pars(String x) {
        int num = 0;
        int i = 0;
        if (x.charAt(0) == '-') {
            i = 1;
        }
        for (; i < x.length(); i++) {
            num = num * 10 + (x.charAt(i) - '0');
        }

        if (x.charAt(0) == '-') {
            return -num;
        }

        return num;
    }

    static void init(InputStream input) {
        reader = new BufferedReader(
                new InputStreamReader(input));
        tokenizer = new StringTokenizer("");
    }

    static void init(FileReader input) {
        reader = new BufferedReader(input);
        tokenizer = new StringTokenizer("");
    }

    static String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(
                    reader.readLine());
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return pars(next());
    }

    static long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }
}


/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

/**
 *
 * @author hartha
 */
public class CodeForces {

    static ArrayList<Edge> g[];

    public static void main(String[] args) throws IOException {
        Reader.init(System.in);
        //Reader.init(new FileReader("input.txt"));
        PrintWriter writer = new PrintWriter(System.out);
        int first = 2, last = 100 ,c = 0;

        while (first <= last) {
            int mid = (first + last) / 2;

            writer.println(mid);
            String s = Reader.next();

            if(s.equals("yes")){
                c++;
                first = mid + 1;
            }

            else
                last = mid - 1;
            writer.flush();

        }

        if(c > 1)
            writer.print("composite");
        else
            writer.println("prime");

        writer.close();
    }

}

class Edge implements Comparable<Edge> {

    int dis, cost;

    public Edge(int dis, int cost) {
        this.dis = dis;
        this.cost = cost;
    }

    @Override
    public int compareTo(Edge o) {
        return this.cost - o.cost;
    }

}

class Reader {

    static BufferedReader reader;
    static StringTokenizer tokenizer;

    public static int pars(String x) {
        int num = 0;
        int i = 0;
        if (x.charAt(0) == '-') {
            i = 1;
        }
        for (; i < x.length(); i++) {
            num = num * 10 + (x.charAt(i) - '0');
        }

        if (x.charAt(0) == '-') {
            return -num;
        }

        return num;
    }

    static void init(InputStream input) {
        reader = new BufferedReader(
                new InputStreamReader(input));
        tokenizer = new StringTokenizer("");
    }

    static void init(FileReader input) {
        reader = new BufferedReader(input);
        tokenizer = new StringTokenizer("");
    }

    static String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(
                    reader.readLine());
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return pars(next());
    }

    static long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }
}


/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

/**
 *
 * @author hartha
 */
public class CodeForces {

    static ArrayList<Edge> g[];

    public static void main(String[] args) throws IOException {
        Reader.init(System.in);
        //Reader.init(new FileReader("input.txt"));
        PrintWriter writer = new PrintWriter(System.out);

        int arr[] = {2,3,5,7,11};
        int num = -1, counter = 0;

        for (int i = 0; i < 4; i++) {
            writer.println(arr[i]);
            writer.flush();

            if(Reader.next().equals("yes")){
                num = i;
                counter++;
            }
        }

        if(counter == 0)
            writer.println("prime");

        else if(counter == 1){
            int first = arr[num] + 1, last = arr[num+1] * 2;

            while(first <= last){
                int mid = (first + last) / 2;

                writer.println(mid);
                writer.flush();

                if(Reader.next().equals("yes")){
                    writer.println("composite");
                    writer.close();
                    return;
                }
            }

            writer.println("prime");
        }

        else
            writer.println("composite");

        writer.close();
    }

}

class Edge implements Comparable<Edge> {

    int dis, cost;

    public Edge(int dis, int cost) {
        this.dis = dis;
        this.cost = cost;
    }

    @Override
    public int compareTo(Edge o) {
        return this.cost - o.cost;
    }

}

class Reader {

    static BufferedReader reader;
    static StringTokenizer tokenizer;

    public static int pars(String x) {
        int num = 0;
        int i = 0;
        if (x.charAt(0) == '-') {
            i = 1;
        }
        for (; i < x.length(); i++) {
            num = num * 10 + (x.charAt(i) - '0');
        }

        if (x.charAt(0) == '-') {
            return -num;
        }

        return num;
    }

    static void init(InputStream input) {
        reader = new BufferedReader(
                new InputStreamReader(input));
        tokenizer = new StringTokenizer("");
    }

    static void init(FileReader input) {
        reader = new BufferedReader(input);
        tokenizer = new StringTokenizer("");
    }

    static String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(
                    reader.readLine());
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return pars(next());
    }

    static long nextLong() throws IOException {
        return Long.parseLong(next());
    }

    static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }
}