# Friends Pairing - 2

easy

1. You are given an integer n, which represents n friends numbered from 1 to n. 2. Each one can remain single or can pair up with some other friend. 3. You have to print all the configurations in which friends can remain single or can be paired up. Note -> Check out the question video and write the recursive code as it is intended without changing signature. The judge can't force you but intends you to teach a concept.

## Constraints

1 <= n <= 10

## Format

### Input

A number n

### Output

Check the sample ouput and question video.

## Example

Sample Input

3

### Sample Output

1.(1) (2) (3)
2.(1) (2,3)
3.(1,2) (3)
4.(1,3) (2)

Question Video