Primes

描述

Write a program to read in a list of integers and determine whether or not each number is prime. A number, n, is prime if its only divisors are 1 and n. For this problem, the numbers 1 and 2 are not considered primes.

输入

Each input line contains a single integer. The list of integers is terminated with a number<= 0. You may assume that the input contains at most 250 numbers and each number is less than or equal to 16000.

输出

The output should consists of one line for every number, where each line first lists the problem number, followed by a colon and space, followed by "yes" or "no".

样例

样例输入 #1

1
2
3
4
5
17
0

样例输出 #1

1: no
2: no
3: yes
4: no
5: yes
6: yes

来源

2008 “Sunline Cup” National Invitational Contest - Warm Up

HDOJ-2161
题目来源:HDOJ-2161
时间限制:1000 MS
内存限制:32768 KB
Java 类名:Main
64 位整数占位符:%I64d