Largest Team Formation

A company is planning a team-building exercise where employees will be divided into teams such that each team has an equal number of members. The goal is to form teams with the largest possible team size that exactly divides the total number of employees. Given the number of employees \(n\), you are to determine the largest team size and the corresponding number of teams formed.

Mathematically, you need to find the largest divisor \(d\) of \(n\) (with \(1 \le d \le n\)) such that:

[ d \mid n ]

The output should be in the form of two integers: the largest team size (\(d\)) and the number of teams (\(n / d\)).

inputFormat

The input consists of a single integer \(n\) representing the total number of employees.

Input format:

$n$

outputFormat

Output two space-separated integers: the largest possible team size and the corresponding number of teams formed.

Output format:

team_size number_of_teams

## sample

100

50 2

</p>