{"status": "success", "data": {"description_md": "The wheel shown below consists of two circles and five spokes, with a label at each point where a spoke meets a circle. A bug walks along the wheel, starting at point \\(A\\). At every step of the process, the bug walks from one labeled point to an adjacent labeled point. Along the inner circle the bug only walks in a counterclockwise direction, and along the outer circle the bug only walks in a clockwise direction. For example, the bug could travel along the path \\(AJABCHCHIJA\\), which has \\(10\\) steps. Let \\(n\\) be the number of paths with \\(15\\) steps that begin and end at point \\(A\\). Find the remainder when \\(n\\) is divided by \\(1000\\).<br><br>$\\includegraphics[width=122, height=117, totalheight=117]{https://latex.artofproblemsolving.com/5/e/1/5e14e54dea77f9fbb819cf7f81efad0cfbce0990.png}$\n___\nLeading zeroes must be inputted, so if your answer is `34`, then input `034`. Full credit goes to [MAA](https://maa.org/) for authoring these problems. These problems were taken on the [AOPS](https://artofproblemsolving.com/) website.", "description_html": "<p>The wheel shown below consists of two circles and five spokes, with a label at each point where a spoke meets a circle. A bug walks along the wheel, starting at point (A). At every step of the process, the bug walks from one labeled point to an adjacent labeled point. Along the inner circle the bug only walks in a counterclockwise direction, and along the outer circle the bug only walks in a clockwise direction. For example, the bug could travel along the path (AJABCHCHIJA), which has (10) steps. Let (n) be the number of paths with (15) steps that begin and end at point (A). Find the remainder when (n) is divided by (1000).<br/><br/><img src=\"https://latex.artofproblemsolving.com/5/e/1/5e14e54dea77f9fbb819cf7f81efad0cfbce0990.png\" width=\"122\" height=\"117\" class=\"problem-image\"/></p>&#10;<hr><p>Leading zeroes must be inputted, so if your answer is <code>34</code>, then input <code>034</code>. Full credit goes to <a href=\"https://maa.org/\">MAA</a> for authoring these problems. These problems were taken on the <a href=\"https://artofproblemsolving.com/\">AOPS</a> website.</p>", "hints_md": "", "hints_html": "", "editorial_md": "", "editorial_html": "", "flag_hint": "", "point_value": 5, "problem_name": "2018 AIME I Problem 10", "can_next": true, "can_prev": true, "nxt": "/problem/18_aime_I_p11", "prev": "/problem/18_aime_I_p09"}}