Given complete graph with $n$ vertices. Andrew in his turn removes exactly one edge and Ben in his turn removes two or three edges. They take turns one after another and Andrew begins. The player loses if the graph is disconnected after his turn. For what $n$ does Ben win and what's his winning strategy? For what $n$ does Andrew win?
Thank you for any hints or solutions!