#include <bits/stdc++.h>
using namespace std;
int bitCount(int n){
  int cn = 0;
  while(n != 0){
    if(n % 2 == 1) cn++;
    n /= 2;
  }
  return cn;
}

int main(){
  int N;
  cin >> N;
  vector<int> nums(N);
  for(int i = 0; i < N; i++){
    nums.at(i) = (i + 1);
  }
  vector<int> ms(N);
  for(int i = 0; i < N; i++){
    ms.at(i) = bitCount(nums.at(i));
  }
  for(int i = 0; i < N; i++){
    cout << ms.at(i);
    if(i == N-1){
      cout << endl;
    }else{
      cout << " ";
    }
  }
  int count = 0;
  int ans = 0;
  int index = 0;
  vector<int> flgs = vector<int>(N,0);
  while(count != N && index < N){
    if(flgs.at(index) && index != 0){
      ans = -1;
      break;
    }
    if(count + ms.at(index) <= N){
      count += ms.at(index);
    }else if(count + ms.at(index) > N){
      count -= ms.at(index);
    }
    flgs.at(index) = 1;
    index = count-1;
    ans++;
    cout << count << "->";
  }
  cout << endl;
  cout << ans << endl;
  return 0;
}