A ladder is a non-decreasing sequence a1,a2,…,a2020 of non-negative integers. Diego and Pablo play by turns with the ladder 1,2,…,2020, starting with Diego. In each turn, the player replaces an entry ai by ai′<ai, with the condition that the sequence remains a ladder. The player who gets (0,0,…,0) wins. Who has a winning strategy?Proposed by Violeta Hernández combinatoricsgame strategy