Deterministic Routing algorithm in hyper cube network

Case study
If we have S = 10(001010) as source and D = 39(100111) as a destination to find route we do
Exclusive-OR between source and destination R = S D = (101101) as illustrated below:
Source 001010
Destination 100111
Route 101101

s0 s1 s2 s3 s4 s5

According to the result of Exclusive-OR, the message will go in this direction (s0 s2 s3 s5) to reach its
destination as shown in the following steps:
Steps 1: take the 1st bit of Route ( 1 0 1 1 0 1) if it equal to 0 skip it if it equal to 1 We take the
corresponding bit in the source and flip it (if one becomes zero and vice versa) .
(0 0 1 0 1 0) (1 0 1 0 1 0).
Steps 2: take the 2nd bit of Route its equal to 0 so skip it, according to algorithm.

Steps 3: take the 3rd bit of Route here it =1 Return to the last result obtained for route (1 0 1 0 1 0) and
take the corresponding (bit 3rd bit) and flip it.
(1 0 1 0 1 0) (1 0 0 0 1 0).
Steps 4: take the 4th bit of Route here it =1 Return to the last result obtained for route (1 0 0 0 1 0) and
take the corresponding (bit 4th bit) and flip it.
(1 0 0 0 1 0) (1 0 0 1 1 0).
Steps 5: take the 5th bit of Route its equal to 0 so skip it, according to algorithm.
Steps 6: take the 6th bit of Route here it =1 Return to the last result obtained for route (1 0 0 1 1 0) and
take the corresponding (bit 6th bit) and flip it.
(1 0 0 1 1 0) (1 0 0 1 1 1).
So the overall path will be:
10(001010) 42(101010) 34(100110) 39(100111).