Problem: This is an interactive problem.

John and his imaginary friend play a game. There are n lamps arranged in a circle. Lamps are numbered 1 through n in clockwise order, that is, lamps i and i + 1 are adjacent for any i = 1, …, n - 1, and also lamps n and 1 are adjacent. Initially all lamps are turned off.

John and his friend take turns, with John moving first. On his turn John can choose to terminate the game, or to make a move. To make a move, John can choose any positive number k and turn any k lamps of his choosing on. In response to this move, John's friend will choose k consecutive lamps and turn all of them off (the lamps in the range that were off before this move stay off). Note that the value of k is the same as John's number on his last move. For example, if n = 5 and John have just turned three lamps on, John's friend may choose to turn off lamps 1, 2, 3, or 2, 3, 4, or 3, 4, 5, or 4, 5, 1, or 5, 1, 2.

After this, John may choose to terminate or move again, and so on. However, John can not make more than 10^4 moves.

John wants to maximize the number of lamps turned on at the end of the game, while his friend wants to minimize this number. Your task is to provide a strategy for John to achieve optimal result. Your program will play interactively for John against the jury's interactor program playing for John's friend.

Suppose there are n lamps in the game. Let R(n) be the number of turned on lamps at the end of the game if both players act optimally. Your program has to terminate the game with at least R(n) turned on lamps within 10^4 moves. Refer to Interaction section below for interaction details.

For technical reasons hacks for this problem are disabled.

Interaction

Initially your program will be fed a single integer n (1 ≤ n ≤ 1000) — the number of lamps in the game. Then the interactor will wait for your actions.

To make a move, print a line starting with an integer k (1 ≤ k ≤ n), followed by k distinct integers l_1, …, l_k (1 ≤ l_i ≤ n) — indices of lamps you want to turn on. The indices may be printed in any order. It is allowed to try to turn on a lamp that is already on (although this will have no effect).

If your move was invalid for any reason, or if you have made more than 10^4 moves, the interactor will reply with a line containing a single integer -1. Otherwise, the reply will be a line containing a single integer x (1 ≤ x ≤ n), meaning that the response was to turn off k consecutive lamps starting from x in clockwise order.

To terminate the game instead of making a move, print a line containing a single integer 0. The test will be passed if at this point there are at least R(n) lamps turned on (note that neither R(n), nor the verdict received are not communicated to your program in any way). This action does not count towards the number of moves (that is, it is legal to terminate the game after exactly 10^4 moves).

To receive the correct verdict, your program should terminate immediately after printing 0, or after receiving -1 as a response.

Don't forget to flush your output after every action.

Examples

Input


3


Output



0


Input


4

1

Output



2 1 3

0

Note

When n = 3, any John's move can be reversed, thus R(3) = 0, and terminating the game immediately is correct.

R(4) = 1, and one strategy to achieve this result is shown in the second sample case.

Blank lines in sample interactions are for clarity and should not be printed.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int arrs[1000][2];
int ok[1000];
void solve() {
  int n;
  scanf("%d", &n);
  if (n < 4) {
    printf("0\n");
    fflush(stdout);
    return;
  }
  int bb = 0;
  int k;
  for (int i = 1; i < n; ++i) {
    int c = n - (n + i - 1) / i - i + 1;
    if (c > bb) {
      bb = c;
      k = i;
    }
  }
  for (int i = 0; i * k < n; ++i) {
    arrs[i][1] = min(k - 1, n - i * k - 1);
  }
  while (true) {
    printf("%d", k);
    bool was = false;
    for (int i = 0; i < k; ++i) {
      int best = 1000;
      int besti = 0;
      for (int j = 0; j * k < n; ++j)
        if (arrs[j][0] < arrs[j][1] && arrs[j][0] < best) {
          best = arrs[j][0];
          besti = j;
        }
      bool f = false;
      for (int j = 1; j < k; ++j)
        if (!ok[besti * k + j]) {
          ok[besti * k + j] = true;
          f = true;
          arrs[besti][0] += 1;
          printf(" %d", besti * k + j + 1);
          break;
        }
      if (!f) {
        printf(" %d", 1);
        was = true;
      }
    }
    printf("\n");
    fflush(stdout);
    int x;
    scanf("%d", &x);
    if (x == -1) return;
    for (int i = 0; i < k; ++i) {
      int p = (x - 1 + i) % n;
      if (ok[p]) {
        ok[p] = 0;
        arrs[p / k][0] -= 1;
      }
    }
    if (was) {
      printf("0\n");
      fflush(stdout);
      return;
    }
  }
}
int main() {
  int T = 1;
  for (int i = 0; i < T; ++i) solve();
  return 0;
}