You have an array of integers , indexed from to . You need to find an array of positive integers where for each .

If there are multiple solutions, minimize the summation of the numbers in . Formally you have to minimize .

You don't need to print the array, we are only interested to know the minimum possible value of .

Note: is the largest integer that isn't more than . For example: and . This is known as Floor Function.