NQueen

import java.util.Scanner;

public class NQueen {
static int[] queenPos = new int[100];
static int N;
static int solve;

public static void main(String[] args) {    Scanner scanner = new Scanner(System.in);    N = scanner.nextInt();    queen(0);    System.out.println(solve);}private static void queen(int q) {    if (q == N) {        solve++;        for (int i = 0; i < N; i++) {                    for (int j = 0; j < queenPos[i]; j++) {                        System.out.print("-");                    }                    System.out.print("*");                    for (int j = queenPos[i] + 1; j < N; j++) {                        System.out.print("-");            }            System.out.println();        }        System.out.println();        return;    }    for (int i = 0; i < N; i++) {        int j;        for (j = 0; j < q; j++) {            if (queenPos[j] == i || Math.abs(queenPos[j] - i) == Math.abs(j - q))                break;        }        if (j == q) {            queenPos[q] = i;            queen(q + 1);        }    }}

}