{"raw_statement":[{"iden":"statement","content":"Attention: we lost all the test cases for this problem, so instead of solving the problem, we need you to generate test cases. We're going to give you the answer, and you need to print a test case that produces the given answer. The original problem is in the following paragraph.\n\nPeople don't use cash as often as they used to. Having a credit card solves some of the hassles of cash, such as having to receive change when you can't form the exact amount of money needed to purchase an item. Typically cashiers will give you as few coins as possible in change, but they don't have to. For example, if your change is 30 cents, a cashier could give you a 5 cent piece and a 25 cent piece, or they could give you three 10 cent pieces, or ten 1 cent pieces, two 5 cent pieces, and one 10 cent piece. Altogether there are 18 different ways to make 30 cents using only 1 cent pieces, 5 cent pieces, 10 cent pieces, and 25 cent pieces. Two ways are considered different if they contain a different number of at least one type of coin. Given the denominations of the coins and an amount of change to be made, how many different ways are there to make change?\n\nAs we mentioned before, we lost all the test cases for this problem, so we're actually going to give you the number of ways, and want you to produce a test case for which the number of ways is the given number. There could be many ways to achieve this (we guarantee there's always at least one), so you can print any, as long as it meets the constraints described below."},{"iden":"input","content":"Input will consist of a single integer _A_ (1 ≤ _A_ ≤ 105), the desired number of ways."},{"iden":"output","content":"In the first line print integers _N_ and _M_ (1 ≤ _N_ ≤ 106, 1 ≤ _M_ ≤ 10), the amount of change to be made, and the number of denominations, respectively.\n\nThen print _M_ integers _D_1, _D_2, ..., _D__M_ (1 ≤ _D__i_ ≤ 106), the denominations of the coins. All denominations must be distinct: for any _i_ ≠ _j_ we must have _D__i_ ≠ _D__j_.\n\nIf there are multiple tests, print any of them. You can print denominations in atbitrary order."},{"iden":"examples","content":"Input\n\n18\n\nOutput\n\n30 4\n1 5 10 25\n\nInput\n\n3\n\nOutput\n\n20 2\n5 2\n\nInput\n\n314\n\nOutput\n\n183 4\n6 5 2 139"}],"translated_statement":[{"iden":"statement","content":"注意：我们丢失了该问题的所有测试用例，因此我们不需要你解决该问题，而是需要你生成测试用例。我们会给你答案，你需要输出一个能产生该答案的测试用例。原问题如下：\n\n人们不像过去那样频繁使用现金了。信用卡解决了现金的一些麻烦，例如当你无法凑出购买商品所需的精确金额时，需要找回零钱。通常收银员会用最少数量的硬币找零，但他们不必如此。例如，如果你的零钱是 30 美分，收银员可以给你一枚 5 美分和一枚 25 美分的硬币，也可以给你三枚 10 美分的硬币，或者十枚 1 美分、两枚 5 美分和一枚 10 美分的硬币。总计有 18 种不同的方式，仅使用 1 美分、5 美分、10 美分和 25 美分的硬币凑出 30 美分。两种方式被认为是不同的，当且仅当至少有一种硬币的数量不同。给定硬币的面额和需要找零的金额，有多少种不同的找零方式？\n\n如前所述，我们丢失了该问题的所有测试用例，因此实际上我们会给你方式的数量，你需要生成一个测试用例，使得该测试用例的答案恰好是给定的数值。可能有多种方式实现这一点（我们保证至少存在一种），因此你可以输出任意一种，只要满足以下约束即可。\n\n输入将包含一个整数 #cf_span[A] #cf_span[(1 ≤ A ≤ 10^5)]，表示期望的方式数。\n\n第一行输出两个整数 #cf_span[N] 和 #cf_span[M] #cf_span[(1 ≤ N ≤ 10^6, 1 ≤ M ≤ 10)]，分别表示需要找零的金额和面额种类数。\n\n然后输出 #cf_span[M] 个整数 #cf_span[D1, D2, ..., DM] #cf_span[(1 ≤ Di ≤ 10^6)]，表示硬币的面额。所有面额必须互不相同：对于任意 #cf_span[i ≠ j]，必须有 #cf_span[Di ≠ Dj]。\n\n如果存在多个合法答案，输出任意一个即可。你可以按任意顺序输出面额。"},{"iden":"input","content":"输入将包含一个整数 #cf_span[A] #cf_span[(1 ≤ A ≤ 10^5)]，表示期望的方式数。"},{"iden":"output","content":"第一行输出两个整数 #cf_span[N] 和 #cf_span[M] #cf_span[(1 ≤ N ≤ 10^6, 1 ≤ M ≤ 10)]，分别表示需要找零的金额和面额种类数。然后输出 #cf_span[M] 个整数 #cf_span[D1, D2, ..., DM] #cf_span[(1 ≤ Di ≤ 10^6)]，表示硬币的面额。所有面额必须互不相同：对于任意 #cf_span[i ≠ j]，必须有 #cf_span[Di ≠ Dj]。如果存在多个合法答案，输出任意一个即可。你可以按任意顺序输出面额。"},{"iden":"examples","content":"输入\n18\n输出\n30 4\n1 5 10 25\n\n输入\n3\n输出\n20 2\n5 2\n\n输入\n314\n输出\n183 4\n6 5 2 139"}],"sample_group":[],"show_order":[],"formal_statement":"$A$ is given. Let $N = A$, $M = 1$, and $D_1 = 1$.","simple_statement":null,"has_page_source":false}