ZGODAN - Problem

#16383. ZGODAN

Statistics

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

如果一个整数的任意两个相邻数字的奇偶性都不同，则该整数被称为“帅气数”（handsome number）。对于给定的整数 $N$，求与其最接近的帅气数。

请注意：仅由一位数字组成的数字也是帅气数。两个数字之间的距离是它们差的绝对值。

输入格式

输入仅包含一行，为一个正整数 $N$，它最多包含 $1000$ 位数字，且它不是一个帅气数。

输出格式

输出仅包含一行，为所求的与 $N$ 最接近的帅气数。如果存在两个最接近的数，则先输出较小的数，再输出较大的数，中间用一个空格隔开。

子任务

在价值 $56$ 分的测试数据中，满足 $N < 10^9$。

样例

输入样例 1

输出样例 1

12 14

输入样例 2

输出样例 2

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