/* decomp.c
   2/27/1999, Oguz Yetkin
   decomposes long ints created by a * 26^2 + b* 26 + c 
   given in Stinson, p158 problem 4.6
*/


#include<stdio.h>
#include<stdlib.h>

/* we won't use last element */
char letters[27]={"ABCDEFGHIJKLMNOPQRSTUVWXYZ"};	

int main(int argc, char** argv){
 	int number,temp;
	char c1,c2,c3;

	if(argc<2){
	  printf("\nuse %s number\n",argv[0]);
	  return 1;
	}
	number=atol(argv[1]);
	c1=letters[(number/676)%26];
	c2=letters[(number/26)%26];
	c3=letters[(number/1)%26];

	printf("%c%c%c",c1,c2,c3);
	return 0;
}