fix this MASM $8086$ CODE $($DO NOT USE CHATGPT and DONT COPY PASTE$)$

so$,$ we have to figure whether number entered is armstrong or not and range is $500$ now whatever i enter let it be $371,$ it is always taken as not armstrong so can you fix my code? I used CHATGPT $4$ so in case you do use that then you are doing the exact opposite of what i said, so kindly answer it and fix it

MASM $808616$ BITS $($don$\text{'}$t use anything that we cannot use in masm $8086$ e$.$g extended registers etc$)$

$.$model small

$.$stack $100$h

$.$data

; Macro definitions for printing strings and numbers

printmsg macro msg

mov ah$,09$h

lea dx$,$ msg

int $21$h

endm

printnum macro reg

mov dl$,$ reg

add dl$,30$h

mov ah$,02$h

int $21$h

endm

; Data segment definition

n dw $?$

p dw $0$

rem dw $?$

z dw $?$

temp dw $?$

cr db $0$dh$,\text{'}$$$\text{'}$

msg$1$ db "Enter a three$-$digit number $($e$.$g$.,153)$$$"$

msg$2$ db $0$ah$,0$dh$,$ "Armstrong$$",0$

msg$3$ db $0$ah$,0$dh$,$ "Not Armstrong$$",0$

msg$4$ db $0$ah$,0$dh$,"$$$"$

$.$code

start:

mov ax$,$ @data

mov ds$,$ ax

; Prompt for number input

printmsg msg$1$

; Read $3$ digits from input converting them into a single number

xor bx$,$ bx ; Clear BX for use as the number accumulator

mov cx$,3$ ; Loop $3$ times for $3$ digits

read$\_$digit:

mov ah$,01$h ; Function $01$h: Read character from STDIN

int $21$h

sub al$,\text{'}0\text{'}$ ; Convert from ASCII to integer

push bx ; Save the current number

mov bx$,10$ ; Multiplier for base $10$

mul bx ; AX $=$ AX $*$ BX $($for shifting previous digits$)$

pop bx ; Restore previous number

add bx$,$ ax ; Add new digit to previous total

loop read$\_$digit

; Save the number

mov n$,$ bx

mov z$,$ bx ; Save the original number for comparison

; Calculate Armstrong number

mov cx$,3$ ; Process each digit

xor bx$,$ bx ; Clear BX for power sum storage

; Calculate Armstrong number

mov cx$,3$ ; Process each digit

xor bx$,$ bx ; Clear BX for power sum storage

calc$\_$armstrong:

mov ax$,$ z ; Use a copy of the original number $\text{'}$z$\text{'}$

mov di$,10$ ; Divisor

div di ; AX $=$ quotient, DX $=$ remainder

mov ax$,$ dx ; Store the remainder in AX

mov temp, ax ; Store the remainder in the 'temp' variable

; Compute ax$^3$

mov cx$,$ ax

mul ax

mul cx

add bx$,$ ax ; Add result to BX $($sum of cubes$)$

mov ax$,$ z ; Load the original $\text{'}$z$\text{'}$ for the quotient

div di ; AX $=$ quotient, DX $=$ remainder

mov z$,$ ax ; Update $\text{'}$z$\text{'}$ with the new quotient

; Check if all digits are processed

test dx$,$ dx ; Test if remainder is zero

jnz calc$\_$armstrong

; Compare results and print message

mov ax$,$ z

cmp ax$,$ bx

je armstrong

printmsg msg$3$

jmp end$\_$program

armstrong:

printmsg msg$2$

end$\_$program:

mov ax$,4$c$00$h ; Terminate program

int $21$h

end start