A. Quirky Quantifiers

{
  "problem": {
    "name": "A. Quirky Quantifiers",
    "description": {
      "content": "",
      "description_type": "Markdown"
    },
    "platform": "Codeforces",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 65536
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "CF952A"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "## Input\n\nThe input contains a single integer _a_ (10 ≤ _a_ ≤ 999).\n\n## Output\n\nOutput 0 or 1.\n\n[samples]...",
      "is_translate": false,
      "language": "English"
    },
    {
      "statement_type": "Markdown",
      "content": "输入包含一个整数 #cf_span[a] (#cf_span[10 ≤ a ≤ 999])。\n\n请输出 0 或 1。\n\n## Input\n\n输入包含一个整数 #cf_span[a] (#cf_span[10 ≤ a ≤ 999])。\n\n## Output\n\n请输出 0 或 1。\n\n[samples]...",
      "is_translate": true,
      "language": "Chinese"
    },
    {
      "statement_type": "Markdown",
      "content": "Given: $ a \\in \\mathbb{Z} $, $ 10 \\leq a \\leq 999 $\n\nOutput: $ \\begin{cases} 0 & \\text{if } \\text{condition} \\\\ 1 & \\text{otherwise} \\end{cases} $\n\n(Note: The condition for outputting 0 or 1 is not sp...",
      "is_translate": false,
      "language": "Formal"
    }
  ]
}