Fixed Password

Source: beecrowd

Version: Phuoc Hung OJ Extended

Problem Statement

A system uses integer password 2002. Read consecutive attempts until the first 2002. Print exactly Senha Invalida for each incorrect attempt, then exactly Acesso Permitido for the correct one and stop. Ignore any subsequent input.

Input

Consecutive lines each contain one integer attempt. The stream is guaranteed to contain the terminating value 2002.

Output

One response line per processed attempt through the correct one, with exact capitalization.

Subtasks

• Subtask 1 (20%): The first attempt equals 2002.
• Subtask 2 (30%): At most 10 failed attempts before 2002; each failed value is in [-1000,1000].
• Subtask 3 (50%): At most 1000 failed attempts before 2002; each failed value is in [-1000000000,1000000000].

Examples

Example 1

Input

2200
1020
2022
2002

Output

Senha Invalida
Senha Invalida
Senha Invalida
Acesso Permitido

Explanation

The first three attempts are wrong; the fourth is 2002, producing the success line.

Example 2

Input

2002

Output

Acesso Permitido

Explanation

The first attempt is correct, so only the success message is printed.