# Code forces 719A Vitya in the Countryside

A. Vitya in the Countryside

time limit per test:1 second

memory limit per test:256 megabytes

input:standard input

output:standard output

Every summer Vitya comes to visit his grandmother in the countryside. This summer, he got a huge wart. Every grandma knows that one should treat warts when the moon goes down. Thus, Vitya has to catch the moment when the moon is down.

Moon cycle lasts 30 days. The size of the visible part of the moon (in Vitya's units) for each day is 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, and then cycle repeats, thus after the second 1 again goes 0.

As there is no internet in the countryside, Vitya has been watching the moon for n consecutive days and for each of these days he wrote down the size of the visible part of the moon. Help him find out whether the moon will be up or down next day, or this cannot be determined by the data he has.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 92) — the number of consecutive days Vitya was watching the size of the visible part of the moon.

The second line contains n integers ai (0 ≤ ai ≤ 15) — Vitya's records.

It's guaranteed that the input data is consistent.

Output

If Vitya can be sure that the size of visible part of the moon on day n + 1 will be less than the size of the visible part on day n, then print "DOWN" at the only line of the output. If he might be sure that the size of the visible part will increase, then print "UP". If it's impossible to determine what exactly will happen with the moon, print -1.

Examples

Input

```5

3 4 5 6 7```

Output

`UP`

Input

```7

12 13 14 15 14 13 12```

Output

`DOWN`

Input

```1

8```

Output

`-1`

Note

In the first sample, the size of the moon on the next day will be equal to 8, thus the answer is "UP".

In the second sample, the size of the moon on the next day will be 11, thus the answer is "DOWN".

In the third sample, there is no way to determine whether the size of the moon on the next day will be 7 or 9, thus the answer is -1.

``` 1 #include <bits/stdc++.h>
2 using namespace std;
3 int main()
4 {
5     int n,i;
6     int a[100];
7     while(cin>>n)
8     {
9         for(i=1;i<=n;i++)
10             cin>>a[i];
11         if(n==1&&a[n]!=15&&a[n]!=0)
12             cout<<-1<<endl;
13         else if(a[n]==15)
14             cout<<"DOWN"<<endl;
15         else if(a[n]==0)
16             cout<<"UP"<<endl;
17         else if(a[n]<15&&a[n]>a[n-1])
18         cout<<"UP"<<endl;
19         else if(a[n]<15&&a[n]<a[n-1])
20             cout<<"DOWN"<<endl;
21     }
22     return 0;
23 }```

0 条评论

• ### Codeforces Round #300(A.【字符串，多方法】，B.【思维题】，C.【贪心,数学】)

A. Cutting Banner time limit per test：2 seconds memory limit per test：256 megaby...

• ### Codeforces Round #301 (Div. 2)(A,【模拟】B,【贪心构造】C,【DFS】)

A. Combination Lock time limit per test：2 seconds memory limit per test：256 mega...

• ### Codeforces Round #345 (Div. 2)【A.模拟，B，暴力，C，STL，容斥原理】

A. Joysticks time limit per test：1 second memory limit per test：256 megabytes in...

• ### 幕后光伏系统的发电临近预报（CS SC)

在低压配电系统中，光伏打系统(PVSs)的数量迅速增加，需要对这些系统进行实时监控。然而，考虑到必要的投资成本，实时监控基础设施的安装似乎在不久的将来无法实现。...

• ### 解决RL好奇心探索后遗忘的问题

Amplifying the Imitation Effect for Reinforcement Learning of

• ### Gazebo機器人仿真學習探索筆記（一）安裝與使用

Gazebo提供了多平臺的安裝和使用支持，大部分主流的linux，Mac以及Windows，這裏結合ROS以Ubuntu爲例進行介紹。

• ### FreeHttp （a fiddler add in to temper the http）

FreeHttp is a Fiddler plugin. With FreeHttp you can modify the request or respon...

• ### ZOJ 3202 Second-price Auction

Time Limit: 1 Second      Memory Limit: 32768 KB

• ### Linux下shell显示用户名和主机名

版权声明：博客文章都是作者辛苦整理的，转载请注明出处，谢谢！ https://blog.cs...