#include <stdio.h>
#include <stdlib.h>

int* beautifulArray(int n, int* returnSize) {
    if (n == 1) {
        int* result = (int*)malloc(sizeof(int));
        result[0] = 1;
        *returnSize = 1;
        return result;
    }
    
    int oddSize, evenSize;
    int* odds = beautifulArray((n + 1) / 2, &oddSize);
    int* evens = beautifulArray(n / 2, &evenSize);
    
    int* result = (int*)malloc(n * sizeof(int));
    int idx = 0;
    
    // Add transformed odds: 2*x-1
    for (int i = 0; i < oddSize; i++) {
        result[idx++] = 2 * odds[i] - 1;
    }
    
    // Add transformed evens: 2*x
    for (int i = 0; i < evenSize; i++) {
        result[idx++] = 2 * evens[i];
    }
    
    free(odds);
    free(evens);
    *returnSize = n;
    return result;
}

int main() {
    int n;
    scanf("%d", &n);
    
    int returnSize;
    int* result = beautifulArray(n, &returnSize);
    
    printf("[");
    for (int i = 0; i < returnSize; i++) {
        printf("%d", result[i]);
        if (i < returnSize - 1) printf(",");
    }
    printf("]\n");
    
    free(result);
    return 0;
}