FACTCG2  Medium Factorization
The task in this problem is to write a number in a multiplication of prime numbers separated by “ x ”. You need to put the number 1 in this multiplication.
Input
The input consists of several lines.
Each line consists of one integer N (1 <= N <= 10^7) .
Output
For each line you need to output the factorization separated by “ x ” and including 1.
Sample
Input 1 2 4 8 Output 1 1 x 2 1 x 2 x 2 1 x 2 x 2 x 2
hide comments
rouge_kitty:
20220905 12:23:01
got TLE twice, then changed *ONE* place where I had used long long int to int, got accepted!!


tracyyi:
20220629 12:39:12
How can we get the test file? 

tarun_28:
20200921 21:56:32
O(log(n)) for each query;) 

ekesh:
20200611 17:32:40
Changing "while(scanf("%d", &n))" to "while(scanf("%d", &n) != EOF)" took me from TLE to AC. 

scolar_fuad:
20190713 11:13:06
Don,t use cin/cout if you do not want to destroy your code.....


x_a_h_i_d:
20190712 08:08:27
thanks.learned about new approach! 

sagar_june97p:
20190618 19:12:43
cin/cout => TLE.


aliakberaakash:
20190328 19:05:02
got tle for not using EOF _ FML! 

eagleshadow:
20180909 00:43:29
Amazing !!


riyuzaki251097:
20180903 19:12:42
Only reason if u are failing tc 4 is cin cout, tried lots of things, scanf printf solved the issue 
Added by:  Phyllipe Medeiros 
Date:  20120226 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 