vector<string> pollards::factoring(string num) {
srand(time(NULL));
// unsigned long long number = stoull(num);
cpp_int number(num);
vector<string> result;
factoring(number, result);
return result;
}
int main(){
find_prime(MAXN-1);
factoring();
scanf("%d",&n);
dfs(0,n,n);
long long temp = result;
if( std::abs(result- temp) < std::abs(result - (temp+1)) ){
std::cout << temp <<std::endl;
}
else {
std::cout << temp+1 <<std::endl;
}
return 0;
}
