减法加加加 - Problem

#14232. 减法加加加

Statistics

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

Alex 和 Steve 刚从一次采矿之旅中回到家，现在他们有多余的圆石。由于他们的房子已经建好了，他们决定玩一个减法游戏。他们轮流从一堆初始数量为 $N$ 的圆石中拿走一些。在第 $i$ 步操作中，轮到的玩家可以拿走 $1$ 到 $i$ 之间的任意数量的圆石。例如，第一步（$i=1$）玩家必须正好拿走 $1$ 个圆石，第二步（$i=2$）玩家可以拿走 $1$ 个或 $2$ 个圆石。

无法进行操作的玩家输掉游戏。Alex 总是先手。如果 Alex 采取最优策略，她会赢吗？

输入格式

第一行包含一个整数 $N$（$1 \le N \le 200\,000$），表示初始的圆石堆大小。

输出格式

如果 Alex 获胜，输出 YES；否则，输出 NO。

样例

输入样例 1

输出样例 1

YES

输入样例 2

输出样例 2

YES

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0

No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0