Indeed, I solved this problem by repeatedly testing random shuffles and printing NO if none of them was winning.

Increasing (maybe except n) sequence.
I.e. something like 1 2 5 3 4, 1 2 3 4 5 6, 7 1 2 3 4 5 6.
And answer is "YES".
Actually, there are only 7 inputs with answer "NO".

Edited by author 14.01.2018 01:28

very simple ;)