Smallest Prime Factor and Its Multiplicity

Given an integer \( n \) such that \( n > 1 \), your task is to determine the smallest prime factor \( p \) of \( n \) and compute the number of times (\( k \)) that \( p \) divides \( n \) completely. In other words, find \( p \) and \( k \) such that \( p^k \) divides \( n \) and \( p \) is the smallest possible prime with this property.

Input Constraints: \( n \) is an integer and \( n > 1 \).

Example:
For \( n = 12 \), the smallest prime factor is \( 2 \) and it divides 12 exactly 2 times (i.e. \( 12 = 2^2 \times 3 \)). The output should be: 2 2.

inputFormat

The input consists of a single integer \( n \) (\( n > 1 \)) provided via standard input.

outputFormat

Output two space-separated integers: the smallest prime factor \( p \) and its multiplicity \( k \) in \( n \), printed to standard output.

12

2 2