Посчитать количество четных элементов массива на нечетных местах

.data
  numbers db "13524689101112131415",0
  count dq 0 ;initialize count to 0
.code
  main:
    mov rdx, offset numbers ;set rdx to address of numbers
    mov rcx, 15 ;set rcx to loop counter
    mov rsi, offset count ;set rsi to address of count
    xor rax, rax ;clear rax to prepare for loop
    loop_start:
      mov al, byte ptr [rdx] ;load byte into al
      cmp al, 0 ;check if end of string
      je loop_end ;exit loop if end of string
      cmp cl, 0 ;check if odd place (cl = loop counter)
      jne next_iteration ;jump to next iteration if even place
      test al, 1 ;check if even number
      jz increment_count ;jump to increment count if even number
      next_iteration:
        inc rdx ;increment address pointer
        dec rcx ;decrement loop counter
        jmp loop_start ;continue loop
      increment_count:
        add qword ptr [rsi], 1 ;increment count
        inc rdx ;increment address pointer
        dec rcx ;decrement loop counter
        jmp loop_start ;continue loop
    loop_end:
      mov rax, [rsi] ;load count into rax
      ;do whatever you want with the count here
      ;for example, print it to the console using printf
      mov rcx, rax ;put count into rcx (first argument)
      lea rdx, [rel message] ;load address of message into rdx (second argument)
      xor rax, rax ;clear rax to prepare for call
      call printf ;call the printf function
      ret ;return from main
      
  printf proto :vararg
  
  message db "Count of even elements in odd places: %d", 0
 
end main