Largest Prime Factor

Given a positive integer \(n\), compute its largest prime factor. Recall that every integer greater than 1 can be factorized as \(n = p_1^{\alpha_1} \times p_2^{\alpha_2} \times \cdots \times p_k^{\alpha_k}\), where \(p_1 < p_2 < \cdots < p_k\) are prime numbers. Your task is to find \(p_k\), the largest prime in the factorization of \(n\).

Input Format: The input contains a single integer \(n\) in standard input (stdin).

Output Format: Output a single integer representing the largest prime factor of \(n\) to standard output (stdout).

Example:

Input:
10
Output:
5

</p>

inputFormat

The input is provided via standard input (stdin) as a single integer \(n\) where \(2 \leq n \leq 10^{14}\).

outputFormat

The output should be a single integer representing the largest prime factor of \(n\), printed to standard output (stdout).

## sample

10

5