Euclid's algorithm returns

gcd$(61,54)=1=2654-2361.$

What is the multiplicative inverse of $61$ mod $54?$

$($Hint: Your answer should be an integer in the range from $0$ through $53.)$