Hashes

Alright,

X is a 36 digit password.

Z = (X mod 10^14)^2.

besides just telling whether it is even/odd and using brute force, how do I find X?

First sqrt(Z) is X mod 10^14, so X is the combination of sqrt(Z) and any multiples of 10^14

X = sqrt(Z)
enterpassword(X)
for n in range(1, inf):

X += 10^14

if (digit(X) == 26)):
enterpassword(X)

if (digit(X) > 26):
break