PROGRAMMING:Roots of balanced binary trees
Insert a given series of numbers into the AVL tree which is initially empty. Please output the value of the root node of the AVL tree generated at last.
###Input format:
The first line of input gives a positive integer $$n $$($$Le 20 $$), and the next line gives $$n $$different integers separated by spaces.
###Output format:
After inserting the above integers into an AVL tree which is initially empty, the value of the root node of the tree is output in one row.
###Input sample 1:
```in
five
88 70 61 96 120
```
###Output sample 1:
```out
seventy
```
###Input sample 2:
```
seven
88 70 61 96 120 90 65
```
###Output sample 2:
```
eighty-eight
```
answer：If there is no answer, please comment
###Input format:
The first line of input gives a positive integer $$n $$($$Le 20 $$), and the next line gives $$n $$different integers separated by spaces.
###Output format:
After inserting the above integers into an AVL tree which is initially empty, the value of the root node of the tree is output in one row.
###Input sample 1:
```in
five
88 70 61 96 120
```
###Output sample 1:
```out
seventy
```
###Input sample 2:
```
seven
88 70 61 96 120 90 65
```
###Output sample 2:
```
eighty-eight
```
answer：If there is no answer, please comment