package main

import . "fmt"
import . "sort"
import . "os"
import bf "bufio"

func main() {
	rd := bf.NewReader(Stdin)
	var n int
	Fscan(rd,&n)
	a := make([]int, n)
	b := make([]int, n-1)
	for i := range a {
		Fscan(rd,&a[i])
	}
	for i := range b {
		Fscan(rd,&b[i])
	}
	Ints(a)
	Ints(b)
	var sum int64
	for i, v := range b {
		sum += int64(abs(a[i+1]-v))
	}
	min := sum
	t := []any{a[0]}
	for i, v := range a[:n-1] {
		sum += int64(abs(v-b[i])-abs(a[i+1]-b[i]))
		if sum < min {
			min = sum
			t = []any{a[i+1]}
		} else if sum == min {
			if t[len(t)-1].(int) != a[i+1] {
				t = append(t, a[i+1])
			}
		}
	}
	Println(len(t))
	Println(t...)
}

func abs(a int) int{
	if a < 0 {
		return -a
	}
	return a
}