Taco's Fish Feeding Observation

In this problem, you are given the number of feeding sessions and an array representing fish feeding events. Each feeding session is represented by an integer (which could be thought of as a fish identifier), and you are also given an integer ( k ). Your task is to determine whether it is possible to have exactly ( k ) feeding observations. In other words, if the number of feeding sessions (i.e., the length of the array) is at least ( k ), then it is possible; otherwise, it is impossible.

More formally, given an integer ( n ) and an array of ( n ) integers followed by an integer ( k ), if ( k \le n ) then print possible, else print impossible.

inputFormat

The input is given from standard input (stdin).

The first line contains an integer ( n ) representing the number of feeding sessions.
The second line contains ( n ) space-separated integers which represent the feeding sessions (fish identifiers).
The third line contains an integer ( k ), the required number of observations.

outputFormat

Output a single word to standard output (stdout): possible if it is possible to have exactly ( k ) feeding observations, or impossible otherwise.## sample

5
3 1 4 1 5
3

possible