You unfortunately got selected for Swig Residence Hall... However, you're lucky enough to be able to choose

your own room, but your quest for convenience comes with a catch $-$ certain rooms are louder than others

when outsiders shout "Wake Up$,$ Swig!".

There are $N$ rooms to pick between and the ith room has a certain volume V$[$i$].$ You want to pick the room with

the lowest score, which is defined by the following formula:

score$(i)={\displaystyle \underset{\{\begin{array}{c}\text{:}[j=0]\\ ji\end{array}}{\overset{N-1}{}}}\frac{V[j]}{|i-j|}$

$($Try and think about what this formula means. You replace the residents of a room i$.$e$.$ their volume doesn't

matter, the further away a room is the less loud it is$,$ etc.$)$

Input Format

The first line is integer $N,$ the number of rooms there are.

The second line contains the volume of room i as a float, V$[$i$].$

please solve the above question in java