SITB  Funny Prime Factorization
Problem Description: You will given an integer number N. Find out the prime factors of this number.
Input
The input consists of several lines.
Each line consists of one integer N ( 2<=N<=10^7 )
Output
In each line you need to print the factors of N seperated by "x".
Example
Input: 2 8 6
Output: 2 = 2 8 = 2 x 2 x 2 6 = 2 x 3
hide comments
weathervane:
20200804 19:39:05
Quite difficult to get the right algorithm as the maximum number of lines in the input is not given. Last edit: 20200811 12:28:31 

raajokiaa_rtiu:
20200701 09:43:22
plz check my code.. it's really hard to find out why i'm getting tle !! 

offamitkumar:
20200622 20:07:40
Try it, It is really funny. 
Added by:  Bappy 
Date:  20191014 
Time limit:  0.170s0.259s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 