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.PrintWriter;
import java.util.InputMismatchException;
import java.util.LinkedList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author George Marcus
 */
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);
		TaskC solver = new TaskC();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskC {
    int[] A;
    int N;

    public void solve(int testNumber, InputReader in, PrintWriter out) {
        N = in.nextInt();

        if(N % 4 > 1) {
            out.println(-1);
            return;
        }

        LinkedList<Integer> left = new LinkedList<Integer>();
        for(int i = 1; i <= N; i++)
            left.addLast(i);

        A = new int[N + 1];
        if(N % 2 == 1)
            A[N / 2 + 1] = N / 2 + 1;
        boolean odd = N % 2 == 1;

        for(int i = 1; i <= N; i++) {
            if(odd && i == N / 2 + 1)
                continue;

            if(A[i] == 0) {
                int other = N - i + 1;
                int k;
                for(int j = 0; ; j++) {
                    k = left.get(j);
                    if(A[k] != 0) {
                        left.remove(j);
                        j--;
                        continue;
                    }
                    if(k != i && k != other) {
                        left.remove(j);
                        break;
                    }
                }
                A[i] = k;
                A[k] = other;
                go(k);
            }
        }

        for(int i = 1; i <= N; i++)
            out.print(A[i] + " ");
    }

    private void go(int k) {
        if(A[A[k]] == 0) {
            A[A[k]] = N - k + 1;
            go(A[k]);
        }
    }
}

class InputReader {
    private InputStream stream;
    private byte[] buf = new byte[1024];
    private int curChar;
    private int numChars;

    public InputReader(InputStream stream) {
        this.stream = stream;
    }

    public int read() {
        if (numChars == -1)
            throw new InputMismatchException();
        if (curChar >= numChars) {
            curChar = 0;
            try {
                numChars = stream.read(buf);
            } catch (IOException e) {
                throw new InputMismatchException();
            }
            if (numChars <= 0)
                return -1;
        }
        return buf[curChar++];
    }

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

    public String nextString() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        StringBuffer res = new StringBuffer();
        do {
            res.appendCodePoint(c);
            c = read();
        } while (!isSpaceChar(c));
        return res.toString();
    }

    private boolean isSpaceChar(int c) {
        return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    }

    }

