logo AlgoBeat OnlineJudge
登录 注册

#200217. [USACO1.5] Superprime Rib

内存限制:125 MiB 时间限制:1000 ms 标准输入输出
题目类型:VJudge(洛谷) 评测方式:VJudge
上传者: 匿名

题目描述

Butchering Farmer John's cows always yields the best prime rib. You can tell prime ribs by looking at the digits lovingly stamped across them, one by one, by Farmer John and the USDA. Farmer John ensures that a purchaser of his prime ribs gets really prime ribs because when sliced from the right, the numbers on the ribs continue to stay prime right down to the last rib, for example:

     7  3  3  1

The set of ribs denoted by is prime; the three ribs are prime; the two ribs are prime, and the last rib, , is prime. The number is called a superprime of length .

Write a program that accepts a number () of ribs and prints all the superprimes of that length.

The number by itself is not a prime number.

输入格式

A single line with the number .

输出格式

The superprime ribs of length , printed in ascending order one per line.

样例

样例输入 1

4

样例输出 1

2333
2339
2393
2399
2939
3119
3137
3733
3739
3793
3797
5939
7193
7331
7333
7393

数据范围与提示

USACO Training Section 1.5.