Question 6
Two round tables each have $n$ dwarves. Each dwarf is initially friends only with the two neighbours at their own table. A wizard may add 2 n friendships between pairs of dwarves, but a witch then removes n of these new friendships. For which $n$ can the wizard guarantee a seating of all 2 n dwarves at one round table with every adjacent pair friends?