Huawei machine test-prime factor

According to the basic theorem of arithmetic, each integer greater than 1 is either a prime number or a product of a series of prime numbers.

Importjava.util.ArrayList;Importjava.util.Arrays;Importjava.util.List;ImportJava.util.Scanner; Public classMain { Public Static voidMain (string[] args) {Scanner Scanner=NewScanner (system.in); Long N=Scanner.nextlong ();        SYSTEM.OUT.PRINTLN (CONVERT (n));    Scanner.close (); }      Public StaticString Convert (Long N) {List<Long> list=NewArraylist<long>(); Long Temp=N;  for(Longi=2;i<=temp/2;i++)        {            if(Isprimarynum (i)) { while(n%i==0) {list.add (i); N=n/i; }                if(n==1)                     Break; }} String restr="";  for(intI=0;i<list.size (); i++) Restr+=list.get (i) + ""; returnRestr.trim (); }         Public Static BooleanIsprimarynum (LongN) {if(n<=1)            return false; if(n==2| | N==3)            return true; Doublesq=math.sqrt (n); if(n%2==0)            return false;  for(inti=3;i<=sq;i+=2)        {            if(n%i==0)                return false; }        return true; }}

Huawei machine test-prime factor