• [E] Flying Chess

  • 时间限制: 1000 ms 内存限制: 65535 K
  • 问题描述
  • TT loves playing Flying chess very much. So she finds a friend mengya to play with her. But they set a new rule. The rules are following:
    One : They control the same one chess.
    Two : The chess is only one.
    Three : They can control the chess to move forward for 1 to 6(1 or 2 or 3 or 4 or 5 or 6) steps.
    Four : TT first, mengya next.

    Five : Who control the chess into the end will win the game.

  • 输入
  • Input until EOF.
    Each case contains one integer N(1<=N<=100000), means the distance steps away from the end.
  • 输出
  • If tt win the game, print "tt wins", else print "mengya wins".
  • 样例输入
  • 1
    2
    3
  • 样例输出
  • tt wins
    tt wins
    tt wins
    
  • 提示
  • 来源
  • Mr.Cai
  • 操作

显示春菜