TASKS - Repeat Your Tasks

Engineer Amal always needs the best work, she always says bad bad repeat your tasks again. She gave her students three tasks T1, T2, T3. after they finish she will give a degree for each task if the square of the sum of all tasks is greater than or equal the optimal degree N so tasks will be accepted otherwise tasks not accepted. Your job now to create a program to check if tasks are accepted or not.

Input

The first line of input contains one integer N (0 < N ≤ 106).

The second line of input contains 3 integers T1, T2, T3 (0 ≤ T1, T2, T3 ≤ 106).

Output

Print "Accepted" or "Not Accepted" (without quotes), depending on the answer.

Examples

Input:
35
1 2 3

Output:
Accepted
Input:
50
1 1 1

Output:
Not Accepted

Added by:atef
Date:2015-04-23
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64 JS-MONKEY

© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.