def modular_inverse(arr, N, P):
    count = 0
    for value in arr[:N]:
        x = value % P
        if (x * x) % P == 1:
            count += 1
    return count