프롬프트 없음
5 5 1 1 2 1 2 1 2 2 3 2 4 1 5 1 4 1 1 4 2 1 3 2 1 3 1 5 5 1
10110
6 4 1 2 3 3 3 3 1 2 2 3 3 4 2 5 5 6 4 6 1 4 6 2 4 6 3 4 6 4
0110
출처: USACO 2019 December Contest, Gold Problem 2. Milk Visits