<SYSTEM_TASK:>
Given the following text description, write Python code to implement the functionality described.
<END_TASK>
<USER_TASK:>
Description:
Count array elements having modular inverse under given prime number P equal to itself
Function to get the count of elements that satisfy the given condition . ; Stores count of elements that satisfy the condition ; Traverse the given array . ; If square of current element is equal to 1 ; Driver Code

<ASSISTANT_TASK:>
Python Code:
def equvInverse(arr , N , P ) : 
	 cntElem = 0 
 for i in range(0 , N ) : 
	 if(( arr[i ] * arr[i ] ) % P == 1 ) : 
	 cntElem = cntElem + 1 
   return cntElem 
  if __name__== "__main __": 
	 arr =[1 , 6 , 4 , 5 ] 
 N = len(arr ) 
 P = 7 
 print(equvInverse(arr , N , P ) ) 
 
<END_TASK>
