int main(){
unsigned long num = 600851475143;
unsigned long result = findLargestPrimeFactor(num);
printf("%lu\n", result);//%lu for unsigned long(int)...who cares...
return 0;
}
int main()
{
int t;
long long int n;
scanf("%d",&t);
while(t--)
{
scanf("%lld",&n);
printf("%lld\n",findLargestPrimeFactor(n));
}
return 0;
}
int main(){
long largestFactor=0;
largestFactor = findLargestPrimeFactor(600851475143);
std::cout<<"Largest Prime Factor is: "<<largestFactor<<std::endl;
return 0;
}
