Euler's method pseudocode iterations

Consider the following pseudocode.

$\begin{array}{l}\mathbf{\text{define}}f(x,y)=e^{xy}\\ x\leftarrow 0\\ y\leftarrow 0\\ h\leftarrow 0.5\\ n\leftarrow 0\\ \mathbf{\text{while}}n\ge 0\\ y\leftarrow y+h\times f(x,y)\\ x\leftarrow x+h\\ n\leftarrow n+1\\ \mathbf{\text{print}}y\\ \end{array}$