dalcon10028

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N, C = sc.nextInt();
        
        for(int i=0; i<C; i++){
            N = sc.nextInt();
            double[] students = new double[N];

dalcon10028

import java.util.*;

public class Main {
    static int count = 0, N;
    static int[] queen;
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        N = sc.nextInt(); sc.close();
        queen = new int[N];
        nqueen(queen, 0);

dalcon10028

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N, C = sc.nextInt();
        
        for(int i=0; i<C; i++){
            N = sc.nextInt();
            double[] students = new double[N];

dalcon10028

import java.util.*;

class Solution {
    public int solution(int[] pri, int locat) {
        ArrayList<int[]> list = new ArrayList<>();
        int count = 0;
        for(int i=0; i<pri.length; i++)
            list.add(new int[] {i, pri[i]}); // 인덱스와 중요도 삽입
        while(!list.isEmpty()){
            boolean print = true;

dalcon10028

import java.util.*;

class Solution {
    public int[] solution(int[] answers) {
int[][] person = {{1, 2, 3, 4, 5},
                          {2, 1, 2, 3, 2, 4, 2, 5},
                          {3, 3, 1, 1, 2, 2, 4, 4, 5, 5}};
        int[] count = {0, 0, 0}; // 각각 a, b, c의 맞은 개수
        
        for (int i=0; i<person.length; i++){ // 사람 수만큼

dalcon10028

class Solution {
    static int[] arr;
    static int tar, count=0;
    public int solution(int[] numbers, int target) {
        arr = numbers; tar = target;
        dfs(0);
        return count;
    }
    static void dfs(int d){
        if (d == arr.length) {

dalcon10028

import java.util.*;

public class Main {
    public static void main(String[] args) {
        LinkedList<Integer> queue = new LinkedList<>();
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        for(int i=1; i<=N; i++)
            queue.add(i);
        while (queue.size()!=1) {

dalcon10028

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (true) {
            String a = sc.nextLine();
            if(a.equals(".")) break; // .은 종료
            String[] input = a.split(""); // 입력값들 쪼개서 넣기
            Stack<String> stack = new Stack<>();

dalcon10028

import java.util.*;

public class Main {
    static long[] memo = new long[91];
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.print(fibo(sc.nextInt()));
    }
    static long fibo(int n){
        if (n<=1) return n;

dalcon10028

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int [][] memo = new int[41][2]; // 각 숫자가 0과 1이 몇 번씩 나오는지
        memo[0][0]=1; memo[1][1]=1; // [0][1], [1][0]은 0으로 자동초기화 됩니다.
        int t = sc.nextInt();
        for(int i=2; i<41; i++)
                for(int j=0; j<2; j++)