#t163. 亲和数

亲和数

Amicable Numbers

Problem Background

Special for beginners, ^_^

Problem Description

A divisor of a natural number aa is any natural number that divides aa, excluding aa itself. For example, the divisors of 1212 are 1,2,3,4,61,2,3,4,6. If the sum of the divisors of aa equals bb, and the sum of the divisors of bb equals aa, then aa and bb are called a pair of "amicable numbers". Find the smallest pair of amicable numbers (a≠ba \neq b).

Input Format

(None)

Output Format

One line containing aa and bb (a<ba < b).

Constraints

1s, 1024KiB for each test case.