A. Anton and Danik

{
  "problem": {
    "name": "A. Anton and Danik",
    "description": {
      "content": "Anton likes to play chess, and so does his friend Danik. Once they have played _n_ games in a row. For each game it's known who was the winner — Anton or Danik. None of the games ended with a tie. N",
      "description_type": "Markdown"
    },
    "platform": "Codeforces",
    "limit": {
      "time_limit": 1000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "CF734A"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Anton likes to play chess, and so does his friend Danik.\n\nOnce they have played _n_ games in a row. For each game it's known who was the winner — Anton or Danik. None of the games ended with a tie.\n\nN...",
      "is_translate": false,
      "language": "English"
    },
    {
      "statement_type": "Markdown",
      "content": "Anton 喜欢下棋，他的朋友 Danik 也喜欢。\n\n他们连续进行了 #cf_span[n] 场游戏。每场比赛都有胜负（非平局），已知每场的胜者是 Anton 还是 Danik。\n\n现在 Anton 想知道，他和 Danik 谁赢的场次更多？请帮助他确定。\n\n输入的第一行包含一个整数 #cf_span[n] (#cf_span[1 ≤ n ≤ 100 000]) —— 表示进行的游戏场数。\n\n第...",
      "is_translate": true,
      "language": "Chinese"
    },
    {
      "statement_type": "Markdown",
      "content": "**Definitions**  \nLet $ n \\in \\mathbb{Z} $ be the number of games, with $ 1 \\leq n \\leq 100{,}000 $.  \nLet $ s \\in \\{A, D\\}^n $ be a string representing the outcomes of the games, where $ s_i = A $ if...",
      "is_translate": false,
      "language": "Formal"
    }
  ]
}