# Queens Permutations - 2d As 2d - Queen Chooses

medium

1. You are given a number n, representing the size of a n * n chess board. 2. You are required to calculate and print the permutations in which n queens can be placed on the n * n chess-board. Note -> Use the code snippet and follow the algorithm discussed in question video. The judge can't force you but the intention is to teach a concept. Play in spirit of the question.

## Constraints

1 <= n <= 5

## Format

### Input

A number n

### Output

Check the sample output and question video

## Example

Sample Input

2

### Sample Output

q1 q2
- -
q1 -
q2 -
q1 -
- q2
q2 q1
- -
- q1
q2 -
- q1
- q2
q2 -
q1 -
- q2
q1 -
- -
q1 q2
q2 -
- q1
- q2
- q1
- -
q2 q1

Question Video