import numpy as np
import scipy
from scipy.spatial import distance
import scipy.optimize
def function_1(arr):
    a=np.array(arr)
    b=np.arange(len(a))
    c=a[::-1]
    a_min=a.max()+1
    for i in range(len(a)):
        ii=c.argmin()
        b[i]=ii
        c[ii]=a_min
    return b

def function_2(matrix):
    summ=0
    for i in matrix:
        ii=i**2
        summ=summ+ii
        ii=0
    return sum(summ)

#np.random.seed(42)
#arr = function_1(np.random.uniform(size=1000000))
#print(arr[7] + arr[42] + arr[445677] + arr[53422])

#np.random.seed(42)
#arr1 = np.random.uniform(size=(1, 100000))
#arr2 = np.random.uniform(size=(100000, 1))
#print(int(function_2(arr1) + function_2(arr2)))

#coord=[(1,2),(10,8)]
#f=[]
#f=(distance.cdist(coord,coord)),
#print(f[f != 0].min())

def f1(a,b):
    c=((a[0]-b[0])**2+(a[1]-b[1])**2)**0.5
    return c
def f2(x):
    f=[]
    for c in points2:
        f.append(f1(c,[x,0]))
    return max(f)
def function_3(points_x, points_y):
    return (int(scipy.optimize.minimize(f2,0, method = 'Nelder-Mead').x))
np.random.seed(42)
arr1 = np.random.uniform(-56, 100, size=100000)
arr2 = np.random.uniform(-100, 100, size=100000)
points2=[]
for i in range(len(arr1)):
    for j in range(len(arr2)):
        if i == j:
            points2.append((arr1[i], arr2[j]))
points2 = np.array(points2)
print(int(round((function_3(arr1, arr2) * 100))))