## CCC '07 J3 - Deal or No Deal Calculator

Points: 3
Time limit: 2.0s
Memory limit: 64M

Problem type
##### Canadian Computing Competition: 2007 Stage 1, Junior #3

In the CCC version of the game, there are possible dollar amounts: , , , , , , , , , sealed in imaginary briefcases. These dollar amounts are numbered (i.e. $$→$$, $$→$$, $$→$$ , ..., $$→$$). Before the game starts the contestant will have chosen one of the briefcases as his/hers to possibly keep. During the game, some of the ten possible dollar amounts have been eliminated from the game because the contestant has selected some of the other briefcases and revealed the amounts inside.

At some point, the contestant will stop opening briefcases, and a "Banker" will offer the contestant cash in exchange for what might be contained in his/her chosen briefcase. Then the contestant is asked: "Deal or No Deal?".

Write a program that helps a player decide if he/she should choose "deal" or "no deal", by calculating the average of the remaining amounts (i.e., all unopened briefcases, including his/her "own" briefcase), and comparing that value to the "Banker's" offer. If the offer is higher than the average, then the player should "deal". Otherwise, the player should say "no deal".

#### Input Specification

The user must input a number which indicates how many cases have been opened so far, followed by a list of integers between and representing the values in the game that have been eliminated, followed by the "Banker's" offer. For example: indicates that briefcases containing , $10000, and$1000000 have been eliminated and the Banker's offer is \$300. You may assume that no duplicate case numbers are entered for the eliminated values, and you may assume that the "Banker's" offer is an integer greater than .

#### Output Specification

The program will print out one of two statements: deal or no deal.

#### Sample Input 1

2
3
8
198000

#### Sample Output 1

no deal

#### Sample Input 2

8
10
9
8
7
6
5
4
3
400

#### Sample Output 2

deal