can you fix this code to where the decryption works properly

from sage.all import $*$

def encode$($s$)$:

s $=$ str$($s$)$

if len$($s$)>71$:

print$(\text{'}$Error$,$ string too long.$\text{'})$

return $0$

return int$($sum$($len$($str$($ord$($s$[$i$])*(128**$ i$)))$ for i in range$($len$($s$))))$

def decode$($n$)$:

v $=[]$

while n $!=0$:

v$.$append$($chr$($n $\%128))$

n $//=128$

return $"".$join$($v$)$

def find$\_$coprime$($n$)$:

coprime$\_$candidate $=$ n $+1$

while gcd$($n$,$ coprime$\_$candidate$)!=1$:

coprime$\_$candidate $+=1$

return coprime$\_$candidate

# Given values

f $=626346493922296891962453123852828762226840739369641575566811218944$

g $=977000403491994460922837866629768065514748480840502199588478427171$

q $=$ find$\_$coprime$($f$)$

h $=$ pow$($f$,-1,$ q$)*$ g $\%$ q

# Encode each value and calculate their lengths

encoded$\_$lengths $=$ sum$($encode$($val$)$ for val in $($f$,$ g$,$ h$))$

print$("$Total length of encoded public key in characters:", encoded$\_$lengths$)$

# Decrypt the message

e $=787184100010685296775885726144975058457369839039986131451577196095$

decrypted$\_$message $=$ power$\_$mod$($e$,$ h$,$ q$)$

print$("$Decrypted message for question $2$:$",$ decode$($decrypted$\_$message$))$

# Additional question $3$ values

q$2=12271828896945466723852667721709432368165618079179670335632592847$

h$2=44285959218806234657242064417806848999251196745309876841294546060$

e$2=67411409695073856848233235796674770260203699443817120950905089296$

def gauss$\_$reduction$($h$2,$ q$2)$:

# Initialize lattice basis vectors

b$1=$ vector$([1,$ Integer$($h$2)])$

b$2=$ vector$([0,$ Integer$($q$2)])$

# Perform Gauss' method of lattice reduction

while True:

# Step $3$: Gram$-$Schmidt orthogonalization

mu $=($b$1*$ b$2)//($b$1*$ b$1)$

if abs$($mu$)<1/2$:

break

b$2-=$ round$($mu$)*$ b$1$

# Exchange b$1$ and b$2$ if necessary

if norm$($b$1)>$ norm$($b$2)$:

b$1,$ b$2=$ b$2,$ b$1$

return b$1,$ b$2$

# Step $4$: Find the shortest vector $($F$,$ G$)$ in the lattice

def find$\_$shortest$\_$vector$($h$2,$ q$2)$:

b$1,$ b$2=$ gauss$\_$reduction$($h$2,$ q$2)$

# Calculate the coefficients of the shortest vector

F $=$ b$1[0]$

G $=$ b$1[1]$

return F$,$ G

# Step $5$: Decrypt the message using Bob's private key

def decrypt$\_$message$($e$2,$ F$,$ G$,$ q$2)$:

# Decrypt using Bob's private key

d $=$ power$\_$mod$($F$,-1,$ q$2)$

decrypted$\_$message $=$ e$2*$ d $\%$ q$2$

return decrypted$\_$message

# Step $6$: Find the shortest vector $($F$,$ G$)$ in the lattice

F$,$ G $=$ find$\_$shortest$\_$vector$($h$2,$ q$2)$

# Step $7$: Decrypt the message using Bob's private key

decrypted$\_$message $=$ decrypt$\_$message$($e$2,$ F$,$ G$,$ q$2)$

print$("$Decrypted message for question $3$: $",$ decode$($decrypted$\_$message$))$