Under construction

Still being built. Things may change

Grenade in the Lake!!

Time limit2sMemory limit512 MB

Summary
Given people on a line with throw ranges, decide whether the grenade can travel from the first person to the last.
Level

Easy3 of 10

Topics
Greedy, Intervals, Implementation
Solved
No attempts yet

Problem

NN people including Ukje stand in a row on a number line. Ukje stands at 00, and the positions are given from left to right in nondecreasing order. A person with range rr can throw the grenade to anyone whose distance is at most rr, and anyone can catch a grenade thrown at them. When several people share one position, any one of them can catch it and throw it onward.

The grenade starts with Ukje. The game ends quietly when the NNth person from the left, the rightmost one, receives it. Everyone cooperates, so the game succeeds when at least one relay path reaches that last person. When the grenade falls to the ground, the game fails.

Input

The first line holds NN with 1≤N≤300001 \le N \le 30000.

The second line holds NN positions from left to right. The first one is Ukje at 00. Each position is an integer with 0≤x≤10000000 \le x \le 1000000.

When N>1N > 1, the third line holds N−1N - 1 ranges in the same order. The first range belongs to Ukje, and the rightmost person is excluded. Each range is an integer with 0≤r≤10000000 \le r \le 1000000. When N=1N = 1, the third line is absent.

Output

When the last person can receive the grenade, print 권병장님, 중대장님이 찾으십니다. Otherwise print 엄마 나 전역 늦어질 것 같아. Print exactly one line including the trailing newline.

Examples2

  1. Example 1

    Input
    5
    0 5 10 15 100
    10 5 6 100
    
    Expected output
    권병장님, 중대장님이 찾으십니다
    
  2. Example 2

    Input
    5
    0 5 10 15 100
    10 5 6 0
    
    Expected output
    엄마 나 전역 늦어질 것 같아