跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2901. Broken checker

  • ID: 2907
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:基础
  • 上传者:
  • 枚举
  • 算法思想
  • 基础
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Broken checker

题目描述

D. Broken checker
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

"This problem is rubbish! There is not statement, and there are only 5 test cases. The problemsetter took liberties with this problem!" − people complained in the comments to one round on Codeforces. And even more... No, wait, the checker for the problem was alright, that's a mercy.

Input

The only line of the input contains an integer between 1 and 5, inclusive. All tests for this problem are different. The contents of the test case doesn't need to be equal to its index.

Output

The only line of the output contains an integer between 1 and 3, inclusive.

Examples
Note

This problem has no samples, since there so few test cases.


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2572 题。保留原作者与原赛事署名。