{"task": {"agent_timeout": 600, "task": "omnimath_4317", "verifier_timeout": 60, "instruction": "# Mathematical Problem\n\nAn arrangement of chips in the squares of $ n\\times n$ table is called [i]sparse[/i] if every $ 2\\times 2$ square contains at most 3 chips. Serge put chips in some squares of the table (one in a square) and obtained a sparse arrangement. He noted however that if any chip is moved to any free square then the arrangement is no more sparce. For what $ n$ is this possible?\n\n[i]\n\n## Instructions\n\nSolve the mathematical problem above and write your final answer to `/workspace/answer.txt`.\n\n**Important**: Write only your final answer to the file, not the full solution process.\n\n### Guidelines\n\n- Provide your final numerical answer or mathematical expression\n- Write the answer as plain text (no special formatting needed)\n- Be precise and clear in your answer\n- The answer should directly respond to what the problem asks for\n\n### Example\n\nIf the problem asks \"What is 2 + 2?\", your answer file should contain:\n\n```\n4\n```\n\nYour answer will be evaluated against the correct solution using an automated grading system.\n", "memory": "", "runnable": false, "difficulty": "hard", "language": "", "cpus": "", "instruction_truncated": false, "category": "math", "compose": false, "has_solution": true, "oracle": null, "docker_image": "", "taskset": "omnimath", "tags": ["omni-math"]}, "runs": []}