modular arithmetic - Using the Euclidean Algorithm how to find the inverse of 41 in Z(131)

I need to find the inverse of 41 in the integers of Z131 and am confused as to how to go about it.

Do I use the Euclidean Algorithm as 41 mod 131?