Civil War

Limits: 2 sec., 256 MiB

This statement was translated automatically from Ukrainian.

The young republic of BrNR decided to liberate the residents of another young republic, BNR, from housing. BrNR has \(n\) artillery installations, while BNR has \(m\) houses. Every day BrNR strikes BNR, destroying one house with each installation. If BrNR has more artillery installations than BNR has houses, BrNR simply destroys all houses. BNR instantly retaliates with an airstrike and destroys 1 installation, regardless of whether they have any intact houses left or not. The conflict will end when BNR has no intact houses left, or BrNR has no artillery installations left.

The young republics ignore all calls for peace, so you need to help Zenik predict how this crisis will end.

Input

The single line contains two space-separated integers — \(n\), \(m\).

Output

If the artillery installations in BrNR and the houses in BNR run out at the same time, output Best possible scenario!.

In a single line output BNR will finally be free!, if BrNR manages to liberate the residents of BNR from houses before they run out of artillery installations.

If BNR manages to defend itself against BrNR and destroy all artillery installations before they destroy all houses, then output Special military operation completely failed!.

Constraints

\(1 \le n,m \le 100\).

Samples