private void start(long a){
		long p = 2L;
		boolean found = false;
		while(!found){
			if(a%p==0){
				a=a/p;
				if(isPrime(a)){
					found=true;
				}
			}
			p=nextPrime(p);
		}
		System.out.println(a);
	}