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.util.*;
import java.io.*;
import java.math.*;
public class Main
{
    static class Reader 
    { 
        private InputStream mIs;private byte[] buf = new byte[1024];private int curChar,numChars;public Reader() { this(System.in); }public Reader(InputStream is) { mIs = is;} 
        public int read() {if (numChars == -1) throw new InputMismatchException();if (curChar >= numChars) {curChar = 0;try { numChars = mIs.read(buf);} catch (IOException e) { throw new InputMismatchException();}if (numChars <= 0) return -1; }return buf[curChar++];} 
        public String nextLine(){int c = read();while (isSpaceChar(c)) c = read();StringBuilder res = new StringBuilder();do {res.appendCodePoint(c);c = read();}while (!isEndOfLine(c));return res.toString() ;} 
        public String s(){int c = read();while (isSpaceChar(c)) c = read();StringBuilder res = new StringBuilder();do {res.appendCodePoint(c);c = read();}while (!isSpaceChar(c));return res.toString();} 
        public long l(){int c = read();while (isSpaceChar(c)) c = read();int sgn = 1;if (c == '-') { sgn = -1 ; c = read() ; }long res = 0; do{ if (c < '0' || c > '9') throw new InputMismatchException();res *= 10 ; res += c - '0' ; c = read();}while(!isSpaceChar(c));return res * sgn;} 
        public int i(){int c = read() ;while (isSpaceChar(c)) c = read();int sgn = 1;if (c == '-') { sgn = -1 ; c = read() ; }int res = 0;do{if (c < '0' || c > '9') throw new InputMismatchException();res *= 10 ; res += c - '0' ; c = read() ;}while(!isSpaceChar(c));return res * sgn;} 
        public double d() throws IOException {return Double.parseDouble(s()) ;}
        public boolean isSpaceChar(int c) { return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; } 
        public boolean isEndOfLine(int c) { return c == '\n' || c == '\r' || c == -1; } 
        public int[] arr(int n){int[] ret = new int[n];for (int i = 0; i < n; i++) {ret[i] = i();}return ret;}
    }
    
    
 
           //       |----|       /\      |    |   -----   |
           //       |   /       /  \     |    |     |     |
           //       |--/       /----\    |----|     |     |
           //       |   \     /      \   |    |     |     |
           //       |    \   /        \  |    |   -----   -------
    static class PriorityComparator implements Comparator<ArrayList<Integer>>
    {
        public int compare(ArrayList<Integer> al1,ArrayList<Integer> al2) 
        {
            for(int i=0;i<al1.size();i++)
            if(al1.get(i)>al2.get(i))return 1;
            else if((al1.get(i)<al2.get(i)))return -1;
            return 0;
        }
    }
    public static void func(int n)
    {
        Integer arr[]=new Integer[n];
        for(int i=0;i<n;i++)
        arr[i]=i+1;
        int counter=0;
        TreeSet<ArrayList<Integer>> hs=new TreeSet<>(new PriorityComparator());
        while(counter++!=10000000)
        {
            Collections.shuffle(Arrays.asList(arr));
            int flag=0;
            for(int i=0;i<n;i++)
            {
                int a=arr[i]-1;
                if(arr[a]!=n-i)
                {
                    flag=1;
                    break;
                }
            }
            if(flag==0)
            {
                ArrayList<Integer> al=new ArrayList<>();
                for(int i=0;i<n;i++)
                al.add(arr[i]);
                hs.add(al);
            }
        }
        System.out.println();
        for(ArrayList<Integer> al:hs)
        {
            for(int i=0;i<al.size();i++)
            System.out.print(al.get(i)+" ");
            System.out.println();
        }
    }
    
    public static void main(String[] args)throws IOException
    {
        Reader sc=new Reader();
        PrintWriter out=new PrintWriter(System.out);
        int n=sc.i();
        //func(n);
        if(n==1)
        out.println(1);
        else if(n%4>1)
        System.out.println(-1);
        else if(n%4==0)
        {
            int arr[]=new int[n];
            int start=2;
            int end=n;
            int pointer=0;
            while(start<end)
            {
                arr[pointer]=start;
                arr[pointer+1]=end;
                pointer+=2;
                start+=2;
                end-=2;
            }
            start =1;
            end =n-1;
            pointer=n-2;
            while(start<end)
            {
                arr[pointer]=start;
                arr[pointer+1]=end;
                pointer-=2;
                start+=2;
                end-=2;
            }
            for(int i=0;i<n;i++)
            out.print(arr[i]+" ");
        }
        else if(n%4==1)
        {
            int arr[]=new int[n];
            int start=2;
            int end=n-1;
            int pointer=0;
            while(start<end)
            {
                arr[pointer]=start;
                arr[n-pointer-1]=end;
                pointer+=2;
                start+=2;
                end-=2;
            }
            start =n;
            end =1;
            pointer=1;
            while(start>end)
            {
                arr[pointer]=start;
                arr[n-pointer-1]=end;
                pointer+=2;
                start-=2;
                end+=2;
            }
            arr[n/2]=n/2+1;
            for(int i=0;i<n;i++)
            out.print(arr[i]+" ");
        }
        out.flush();
    }
}