A year ago the famous gangster Vito Maretti woke up in the
morning and realized that he was bored of robbing banks of
round sums. And for the last year he has been taking from
banks sums that have only digits 1 and 2 in their decimal notation.
After each robbery, Vito divides the money between N
members of his gang. Your task is to determine the minimal
stolen sum which is a multiple of N.
Input
The input contains the number N
(1 ≤ N ≤ 10^{6}).
Output
Output the minimal number which is a multiple of N and whose decimal notation contains only digits 1 and 2. If it contains more than 30 digits or if there are no such numbers, then output "Impossible".
Samples
input  output 

5
 Impossible

8
 112

Problem Author: Igor Chevdar
Problem Source: XIIIth USU Junior Contest, October 2006