import math as m
def count_corr(lst1,lst2):
    n = min(len(lst1),len(lst2))
    sred1 = sum(lst1[:n+1])/(n)
    sred2 = sum(lst2[:n+1])/(n)
    down1 = 0;down2 = 0;up = 0
    for i in range(n):
        down1 += ((lst1[i] - sred1)**2)
        down2 += ((lst2[i] - sred2)**2)
        up += (lst1[i] - sred1)*(lst2[i] - sred2)
    print(up,m.sqrt(down1*down2))
    return up / m.sqrt(down1*down2)