Largest Prime Factor

You are given a positive integer \(n\). Your task is to compute the largest prime factor of \(n\). The problem involves prime factorization: decomposing \(n\) into a product of prime numbers. For example, if \(n = 13195\), its prime factors are \(5\), \(7\), \(13\), and \(29\), and the largest among these is \(29\).

Please note that the input will be provided via standard input (stdin) and the output should be printed to standard output (stdout).

inputFormat

The input consists of a single line containing one positive integer \(n\) (\(2 \le n \le 10^{15}\)).

outputFormat

Output the largest prime factor of \(n\) on a single line.

2

2