CSES – Permutations

#include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define f first
#define s second
#define fastio ios_base::sync_with_stdio(0);cin.tie(0)
using namespace std;
//declare
int n;
queue<int> q1,q2;
//
signed main(){
    fastio;
    cin>>n;
    if(n == 1) return cout<<"1\n", 0;
    if(n <= 3) return cout<<"NO SOLUTION\n", 0;
    if(n == 4) return cout<<"2 4 1 3\n", 0;
    for(int i=1;i<=(n+1)/2;i++) q1.push(i);
    for(int i=(n+1)/2+1;i<=n;i++) q2.push(i);
    while(q1.size()){
        cout<<q1.front()<<" "; q1.pop();
        if(q2.size()) cout<<q2.front()<<" ", q2.pop();
    }
    return 0;
}