#include <bits/stdc++.h>
using namespace std;
inline bool EQ(double a, double b) { return fabs(a - b) < 1e-9; }
template <typename T>
inline T gcd(T a, T b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
template <typename T>
inline T lcm(T a, T b) {
  return (a * b) / gcd(a, b);
}
template <typename T>
string toStr(T x) {
  stringstream st;
  st << x;
  string s;
  st >> s;
  return s;
}
template <class T>
void splitStr(const string &s, vector<T> &out) {
  istringstream in(s);
  out.clear();
  copy(istream_iterator<T>(in), istream_iterator<T>(), back_inserter(out));
}
inline int two(int n) { return 1 << n; }
inline int isOnBit(int n, int b) { return (n >> b) & 1; }
inline void onBit(int &n, int b) { n |= two(b); }
inline void offBit(int &n, int b) { n &= ~two(b); }
inline int lastBit(int n) { return n & (-n); }
inline int cntBit(int n) {
  int res = 0;
  while (n && ++res) n -= n & (-n);
  return res;
}
const int dx4[] = {-1, 0, 1, 0};
const int dy4[] = {0, 1, 0, -1};
const int dx8[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dy8[] = {0, 1, 0, -1, -1, 1, -1, 1};
int n, ans[100000 + 5];
void solve() {
  if (n % 4 == 2 || n % 4 == 3) {
    puts("-1");
    return;
  } else if (n == 1) {
    puts("1");
    return;
  }
  int i = 1;
  while (i <= (n + 1) / 2) {
    if (i == (n + 1) / 2) {
      ans[i] = i;
      break;
    }
    ans[i] = i + 1;
    ans[n - i + 1] = (n + 1) - ans[i];
    i++;
    ans[i] = n - i + 2;
    ans[n - i + 1] = i - 1;
    i++;
  }
  for (int i = (1), _b = (n); i <= _b; i++) printf("%d ", ans[i]);
}
int main() {
  scanf("%d", &n);
  solve();
  return 0;
}
