# Random

**Problem Statement**

A sequence of N numbers is sorted in an increasing order if the element[i]<=element[i+1], for all non-negative i less than (N-1).

Given N and the sequence of numbers, order the elements such that the sequence will NOT be sorted in increasing order. Output the lexicographically smallest such sequence possible. In case there is no such possibility determined where the sequence is in increasing order, print "NULL" (double quotes for clarification).

**Input**

First line of input contains N and the following line contains the N elements. Read the data until End of File.

**Output**

Print the sequence and in case the sequence is not in increasing order,print "NULL".

**Constraints**

0<=i<(N-1)

1<=N<=50

All elements of the sequence will be between 1 and 1000.

**Sample Input**

```
```

2

1 1

4

1 2 1 1

3

1 3 4

4

1 2 4 3

3

6 2 3

**Sample Output**

```
```

NULL

1 1 2 1

1 4 3

1 2 4 3

2 6 3

*Problem Setter : Anjali Singh*

**Languages:**C,C++,Java