AT_abc422_a [ABC422A] Stage Clear

Takahashi is playing a game. This game has eight worlds, and each world has eight stages. The stages have an order, and the first stage is the $ 1 $ st stage in the $ 1 $ st world. The next stage after the $ j $ -th stage $ (1\le j\le 8) $ in the $ i $ -th world $ (1\le i\le 8) $ is as follows: - When $ j\lt8 $ , the next stage is the $ (j+1) $ -th stage in the $ i $ -th world. - When $ i\lt8,j=8 $ , the next stage is the $ 1 $ st stage in the $ (i+1) $ -th world. - When $ i=8,j=8 $ , there is no next stage. This stage is the last stage. The name of the $ j $ -th stage $ (1\le j\le 8) $ in the $ i $ -th world $ (1\le i\le 8) $ is $ i $ - $ j $ . For example, the name of the first stage is `1-1`, and the name of the last stage is `8-8`. Given the stage name $ S $ of the stage Takahashi is currently playing, output the stage name of the next stage.

The input is given from Standard Input in the following format: > $ S $

Output the stage name of the next stage.

### Sample Explanation 1 The next stage after the $ 2 $ nd stage in the $ 4 $ th world is the $ 3 $ rd stage in the same world. ### Sample Explanation 2 `1-8` is the last stage in the $ 1 $ st world, so the next stage is the $ 1 $ st stage in the $ 2 $ nd world. ### Constraints - $ S $ is the stage name of one of the stages. - $ S $ is not `8-8`.