# Task
 Given a sorted array of integers `A`, find such an integer x that the value of `abs(A[0] - x) + abs(A[1] - x) + ... + abs(A[A.length - 1] - x)`
is the smallest possible (here abs denotes the `absolute value`).
 If there are several possible answers, output the smallest one.
# Example
 For `A = [2, 4, 7]`, the output should be `4`.
# Input/Output
 - `[input]` integer array `A`
    A non-empty array of integers, sorted in ascending order.
    Constraints:
    `1 ≤ A.length ≤ 200,`
    `-1000000 ≤ A[i] ≤ 1000000.`
 - `[output]` an integer
def absolute_values_sum_minimization(A):
    return A[(len(A)-1)//2]
def absolute_values_sum_minimization(A):
    return A[(len(A)-1)//2]