#include <iostream>
#include <fstream>
#include <vector>
#include <set>
using namespace std;

#define N 1000000


int main(void)
{
	ifstream in("roots.txt");

	//vector<int> primes(N);

	int i;

	/*for(i = 0 ; i < N ; i++) primes[i] = 1;
	primes[0] = 0;
	primes[1] = 0;
	primes[2] = 1;
	for(i = 2 ; i < N ; i ++){
		if(primes[i] == 1){
			for(int t = i*i ; t < N ; t += i){
				primes[t] = 0;
			}
		}
	}*/
	set<int> primeset;
	primeset.insert(2);
	primeset.insert(3);
	int j, k;
	for ( i=5 ; i<N ; i+=2 ) {
		for ( j=3 ; j*j<=i && i%j!=0 ; j+=2 ) ;
		if ( i%j!=0 ) primeset.insert(i);
	}

	//cout << "test1" << endl;
	int m;
	while(in >> m){
		if(m == 0) break;
		printf("% 7d ",m);


		while(m > 9){
			if(primeset.count(m) == 1){
				break;
			}
			int m1 = m;
			int m2 = 0;
			while(m1 > 9) {m2 += m1%10; m1/=10;}
			m = m2+m1;
		}
		if(primeset.count(m) == 1){
			printf("% 7d\n",m);
		}else{
			printf("   none\n");
		}
	}
}