There is no single optimal move. There is exactly two moves, one of which is optimal. On every step of greedy, you must choose best of them.