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.*;

public class Main {

    public static void main(String[] args) throws Exception {

//        Scanner input = new Scanner(new BufferedReader(new InputStreamReader(System.in), 16000));
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream), 64000));


        
        // 2 8 4 6 3 5 1 7
        // 
        
        // 13   12   11  10   9    8   7   6   5   4    3     2     1
        // 1      2    3    4     5    6   7   8   9   10   11   12   13
        // 2     13   4   11    6    9   7   5   8    3    10    1   12

         int n = in.nextInt(); 
         boolean odd = false ; 
         int oddV = 0 ; 
         
         if(n % 2 != 0) {
             odd = true ;
             oddV = 1 ; 
             n-- ; 
         }
         
         if(n % 4 != 0){
             out.println(-1);
             out.close(); 
             return ; 
         }
         
         
         for(int i = 2 ; i <= n / 2 ; i+=2){
             out.println(i );
             out.println(n + 2 + oddV - i );
         }
         
         
         if(odd) out.println((n/ 2) + 1);
         
         
         for(int i =  n / 2  + 1 ; i <= n - 1 ; i += 2) {
             out.println(n - i); 
             out.println(i + oddV);
         }
         
         
         
        
         
         
         

         
        out.close();
    }

   

    
}

class InputReader {

    public BufferedReader reader;
    public StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream), 64000);
        tokenizer = null;
    }

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

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

    public long nextLong() {
        return Long.parseLong(next());
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }
}
