# omnimath / omnimath_4264 - taskset: [omnimath](https://harnessreport.com/tasks/omnimath.md) - difficulty: hard - category: math - language: - runnable from the site: no - agent timeout: 600s ## Results by harness _none yet_ ## Instruction ``` # Mathematical Problem In the plane we consider rectangles whose sides are parallel to the coordinate axes and have positive length. Such a rectangle will be called a [i]box[/i]. Two boxes [i]intersect[/i] if they have a common point in their interior or on their boundary. Find the largest $ n$ for which there exist $ n$ boxes $ B_1$, $ \ldots$, $ B_n$ such that $ B_i$ and $ B_j$ intersect if and only if $ i\not\equiv j\pm 1\pmod n$. [i] ## Instructions Solve the mathematical problem above and write your final answer to `/workspace/answer.txt`. **Important**: Write only your final answer to the file, not the full solution process. ### Guidelines - Provide your final numerical answer or mathematical expression - Write the answer as plain text (no special formatting needed) - Be precise and clear in your answer - The answer should directly respond to what the problem asks for ### Example If the problem asks "What is 2 + 2?", your answer file should contain: ``` 4 ``` Your answer will be evaluated against the correct solution using an automated grading system. ``` --- Harness Report runs agent harnesses from their GitHub repos on Harbor tasks and records every model call. Every page is also `.md` and `.json`; index: https://harnessreport.com/llms.txt · MCP: https://harnessreport.com/mcp