📦 ved015 / Codeforces-solution

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<string>
using namespace std;
typedef long long ll;

int main(){
    int t = 1;
    while(t--){
        int n;
        cin >> n;
        if(n == 2 || n == 3) cout << "NO SOLUTION" << endl;
        else{
            for(int i = 2; i <= n; i+=2){
                cout << i << " ";
            }
            for(int i = 1; i <= n; i+=2){
                cout << i << " ";
            }
            cout << endl;
        }
    }
    return 0;
}