Prime Land

Description

Everybody in the Prime Land is using a prime base number system. In this system, each positive integer x is represented as follows: Let {pi}i=0,1,2,... denote the increasing sequence of all prime numbers. We know that x > 1 can be represented in only one way in the form of product of powers of prime factors. This implies that there is an integer kx and uniquely determined integers e_kx, e_kx-1, ..., e₁, e₀, (e_kx > 0), that The sequence

(e_kx, e_kx-1, ... ,e₁, e₀)



is considered to be the representation of x in prime base number system.

It is really true that all numerical calculations in prime base number system can seem to us a little bit unusual, or even hard. In fact, the children in Prime Land learn to add to subtract numbers several years. On the other hand, multiplication and division is very simple.

Recently, somebody has returned from a holiday in the Computer Land where small smart things called computers have been used. It has turned out that they could be used to make addition and subtraction in prime base number system much easier. It has been decided to make an experiment and let a computer to do the operation ``minus one''.

Help people in the Prime Land and write a corresponding program.

For practical reasons we will write here the prime base representation as a sequence of such pi and ei from the prime base representation above for which ei > 0. We will keep decreasing order with regard to pi.

Input

The input consists of lines (at least one) each of which except the last contains prime base representation of just one positive integer greater than 2 and less or equal 32767. All numbers in the line are separated by one space. The last line contains number 0.

Output

The output contains one line for each but the last line of the input. If x is a positive integer contained in a line of the input, the line in the output will contain x - 1 in prime base representation. All numbers in the line are separated by one space. There is no line in the output corresponding to the last ``'' line of the input.

Sample Input

17 1
5 1 2 1
509 1 59 1
0

Sample Output

2 4
3 2
13 1 11 1 7 1 5 1 3 1 2 1

解题思路：//反复试除，从可能的最大的素数一直往下查找。 例：输入：5 1 2 1 则x=5^1*2^1=10,所以x-1=9，9可以表示成：9=3^2               输出：3 2

获得素数的算法（我写了两种，其中一种较精炼，就是从i=2开始找i的倍数，再i++，直到M就可以查找完了。

#include<stdio.h>
#include<math.h>
#include<string.h>
const int MAX=33333;
int prime[MAX],num;
bool is[MAX];
/*int getpri()//获得素数
{
	int i,j,k=0,d;
	is[1]=true;
	is[2]=false;
	for(i=2;i<=(int)sqrt((double)MAX+0.0);i++)
	{
		d=1;
		if(is[i]==false)
		{
			for(j=2;d<33333;j++)
			{
				d=i*j;
				is[d]=true;
				if(d>=33333)
					break;
			}
		}
	}
	for(i=2;i<33333;i++)
	{
		if(is[i]==false)
			prime[k++]=i;
	}
	return k;
}*/
int getpri()
{
	int i,j,k=0;
	memset(is,true,sizeof(is));
	for(i=2;i<=MAX;i++)
	{
		if(is[i])
		{
			prime[k++]=i;
           for(j=i+i;j<MAX;j+=i)
			   is[j]=false;
		}
	}
	return k;
}
void fun(int x)  //函数处理。
{
   int i,cnt=0;
   bool frist=true;
   for(i=num-1;i>=0;--i)
   {
	   cnt=0;
       while(x%prime[i]==0)
	   {
		   cnt++;
		   x/=prime[i];
	   }
	   if(cnt)
	   {
		   if(frist)
		   {
			   printf("%d %d",prime[i],cnt);
			   frist=false;
		   }
		   else
			   printf(" %d %d",prime[i],cnt);
	   }
   }
   printf("\n");
}
int main()
{
	int p,e;
	num=getpri();
	while(true) //循环求值。
	{
		int sum=1;
		while(true)
		{
			scanf("%d",&p);
			if(p==0)
				return 0;
			scanf("%d",&e);
             sum*=(int)pow((double)p,e);//sum *= (int)pow(p,e);没有double提交就会出现编译错误。
			 if(getchar()=='\n')//出现回车键就结束输入。
				 break;
		}
		fun(sum-1);  //处理数据。
	}
	return 0;
}