#include <bits/stdc++.h>   using namespace std;   int p[100003];   int n;   int main() {     int i;     scanf( %d , &n);     if (n == 1) {       printf( 1 n );       return 0;     }     if (n == 2) {       printf( -1 n );       return 0;     }     if (n % 2 != 0) p[n / 2 + 1] = n / 2 + 1;     p[1] = 2;     p[2] = n;     p[n] = n - 1;     p[n - 1] = 1;     for (i = 3; i < n / 2 + 1; i++) {       if (i % 2 != 0)         p[i] = p[i - 2] + 2;       else         p[i] = p[i - 2] - 2;     }     int coun = 0;     if (n % 2 == 0) {       for (i = n - 2; i > n / 2; i--) {         if (coun % 2 == 0)           p[i] = p[i + 2] - 2;         else           p[i] = p[i + 2] + 2;         coun++;       }     } else {       for (i = n - 2; i > n / 2 + 1; i--) {         if (coun % 2 == 0)           p[i] = p[i + 2] - 2;         else           p[i] = p[i + 2] + 2;         coun++;       }     }     bool fl = true;     for (i = 1; i <= n; i++)       if (p[p[i]] != n - i + 1) fl = false;     if (fl) {       printf( %d , p[1]);       for (i = 2; i <= n; i++) printf(  %d , p[i]);       printf(  n );     } else       printf( -1 n );     return 0;   }   