For problem statement at 1000-1999/1300-1399/1360-1369/1361/problemC.txt this is a correct solution, but verifier at 1000-1999/1300-1399/1360-1369/1361/verifierC.go ends with case 1 failed
expected:
2
1 2 5 6 4 3 8 7

got:
2
8 7 3 4 5 6 2 1

exit status 1 can you fix the verifier? ```go
package main

import (
	"bufio"
	"io"
	"os"
	"strconv"
)

func findRoot(parent []int32, x int32) int32 {
	root := x
	for parent[root] != root {
		root = parent[root]
	}
	curr := x
	for parent[curr] != root {
		nxt := parent[curr]
		parent[curr] = root
		curr = nxt
	}
	return root
}

func main() {
	content, _ := io.ReadAll(os.Stdin)
	pos := 0

	nextInt := func() int32 {
		for pos < len(content) && (content[pos] < '0' || content[pos] > '9') {
			pos++
		}
		if pos >= len(content) {
			return 0
		}
		var res int32 = 0
		for pos < len(content) && content[pos] >= '0' && content[pos] <= '9' {
			res = res*10 + int32(content[pos]-'0')
			pos++
		}
		return res
	}

	n := int(nextInt())
	if n == 0 {
		return
	}

	U := make([]int32, n)
	V := make([]int32, n)
	for i := 0; i < n; i++ {
		U[i] = nextInt()
		V[i] = nextInt()
	}

	deg := make([]int32, 1<<20)
	parent := make([]int32, 1<<20)

	var bestK int
	for k := 20; k >= 0; k-- {
		mask := int32((1 << k) - 1)

		for i := 0; i < n; i++ {
			u := U[i] & mask
			v := V[i] & mask
			parent[u] = u
			parent[v] = v
			deg[u] = 0
			deg[v] = 0
		}

		for i := 0; i < n; i++ {
			u := U[i] & mask
			v := V[i] & mask
			deg[u]++
			deg[v]++
		}

		valid := true
		for i := 0; i < n; i++ {
			u := U[i] & mask
			v := V[i] & mask
			if deg[u]%2 != 0 || deg[v]%2 != 0 {
				valid = false
				break
			}
		}

		if !valid {
			continue
		}

		for i := 0; i < n; i++ {
			u := U[i] & mask
			v := V[i] & mask
			rootU := findRoot(parent, u)
			rootV := findRoot(parent, v)
			if rootU != rootV {
				parent[rootU] = rootV
			}
		}

		firstRoot := findRoot(parent, U[0]&mask)
		for i := 1; i < n; i++ {
			if findRoot(parent, U[i]&mask) != firstRoot {
				valid = false
				break
			}
		}

		if valid {
			bestK = k
			break
		}
	}

	writer := bufio.NewWriter(os.Stdout)
	defer writer.Flush()
	writer.WriteString(strconv.Itoa(bestK))
	writer.WriteByte('\n')

	mask := int32((1 << bestK) - 1)
	head := make([]int32, 1<<20)
	for i := range head {
		head[i] = -1
	}

	next := make([]int32, 2*n)
	to := make([]int32, 2*n)
	pf := make([]int32, 2*n)
	pt := make([]int32, 2*n)
	eid := make([]int32, 2*n)

	edgeCount := int32(0)
	addEdge := func(u, v, id, pFrom, pTo int32) {
		to[edgeCount] = v
		eid[edgeCount] = id
		pf[edgeCount] = pFrom
		pt[edgeCount] = pTo
		next[edgeCount] = head[u]
		head[u] = edgeCount
		edgeCount++
	}

	for i := int32(0); i < int32(n); i++ {
		u := U[i] & mask
		v := V[i] & mask
		addEdge(u, v, i, 2*i+1, 2*i+2)
		addEdge(v, u, i, 2*i+2, 2*i+1)
	}

	usedEdge := make([]bool, n)
	path := make([]int32, 0, 2*n)

	type Frame struct {
		u  int32
		pf int32
		pt int32
	}
	stack := make([]Frame, 0, 2*n+1)
	stack = append(stack, Frame{u: U[0] & mask, pf: -1, pt: -1})

	for len(stack) > 0 {
		u := stack[len(stack)-1].u

		e := head[u]
		for e != -1 && usedEdge[eid[e]] {
			e = next[e]
		}
		head[u] = e

		if e != -1 {
			usedEdge[eid[e]] = true
			stack = append(stack, Frame{u: to[e], pf: pf[e], pt: pt[e]})
		} else {
			f := stack[len(stack)-1]
			stack = stack[:len(stack)-1]
			if f.pf != -1 {
				path = append(path, f.pt, f.pf)
			}
		}
	}

	for i := len(path) - 1; i >= 0; i-- {
		writer.WriteString(strconv.Itoa(int(path[i])))
		writer.WriteByte(' ')
	}
	writer.WriteByte('\n')
}
```