#include <iostream>
#include <algorithm>

using namespace std;
int a[3010],b[3010];
int main(){
    int i,n; cin >> n;
    for(i=0;i<n;i++) a[i] = 3*i;
    for(i=0;i<n;i++) b[i] = 3*i + 7;
    if(n%3==1) a[0] = 1;
    if(n%3==2){
        a[0] = 1; a[1] = 4;
        for(i=2;i<n;i++) a[i] = 3*i - 3;
    }
    int sum = 0;
    for(i=0;i<n;i++) sum += b[i] - a[i];
    int j = n - 1;
    a[n] = 10001;
    while(sum){
        a[j] += 3; sum -= 3;
        if(a[j] + 3>=a[j + 1]) j--;
    }
    sort(a,a + n); sort(b,b + n);
    for(i=0;i<n;i++) cout << a[i] << " ";
    cout << endl;
    for(i=0;i<n;i++) cout << b[i] << " ";
    cout << endl;
}