소스 코드 제출

# def prime(n):

# if n == 2:

# print("prime")

# return

# for i in range(2, n):

# if n % i == 0:

/*

#include <stdio.h>

int stack[201]={};

int ttop=-1;

void push(int a)

{

# c = list(input())

# h = len(c)

# count = 10

#

# for i in range(1, h):

#

# a,b =input().split()

# a=int(a)

# b=int(b)

# if b>=30 :

# b=b-30

# else :