A permutation p of size n is the sequence p1, p2, ..., pn, consisting of n distinct integers, each of them is from 1 to n (1 ≤ pi ≤ n).

A lucky permutation is such permutation p, that any integer i (1 ≤ i ≤ n) meets this condition ppi = n - i + 1.

You have integer n. Find some lucky permutation p of size n.

Input

The first line contains integer n (1 ≤ n ≤ 105) — the required permutation size.

Output

Print "-1" (without the quotes) if the lucky permutation p of size n doesn't exist.

Otherwise, print n distinct integers p1, p2, ..., pn (1 ≤ pi ≤ n) after a space — the required permutation.

If there are multiple answers, you can print any of them.

Examples

Input

1


Output

1 


Input

2


Output

-1


Input

4


Output

2 4 1 3 


Input

5


Output

2 5 3 1 4 
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.util.LinkedList;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskA solver = new TaskA();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskA {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            if (n % 4 < 2) {
                LinkedList<Integer> ans = new LinkedList<>();
                int curN = 0;
                if (n % 4 == 1) {
                    ans.add(1);
                    curN = 1;
                } else {
                    ans.add(2);
                    ans.add(4);
                    ans.add(1);
                    ans.add(3);
                    curN = 4;
                }
                while (ans.size() < n) {
                    ans.addFirst(curN + 4);
                    ans.addFirst(2);
                    ans.addLast(1);
                    ans.addLast(curN + 3);
                    curN += 4;
                }
                int[] ansArr = new int[n];
                int k = 0;
                for (int i : ans) {
                    ansArr[k] = i;
                    k++;
                }
                for (int i = 0; i < n / 4; i++) {
                    ansArr[2 * i] += 2 * i;
                    ansArr[2 * i + 1] += 2 * i;
                    ansArr[n - 1 - 2 * i] += 2 * i;
                    ansArr[n - 2 - 2 * i] += 2 * i;
                }
                if (n % 4 == 1) {
                    ansArr[n / 2] += 2 * (n / 4);
                }
                for (int i : ansArr) {
                    out.print(i + " ");
                }
            } else {
                out.println(-1);
            }
        }

    }

    static class InputReader {
        private StringTokenizer tokenizer;
        private BufferedReader reader;

        public InputReader(InputStream inputStream) {
            reader = new BufferedReader(new InputStreamReader(inputStream));
        }

        private void fillTokenizer() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (Exception e) {
                    throw new RuntimeException(e);
                }
            }
        }

        public String next() {
            fillTokenizer();
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}

