dalcon10028

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt(); // 자연수
        sc.close();
        for(int i=0; i<N; i++){ // 0부터 분해합 검사
            int decompos=i; // 분해합이 될 변수
            String numtoString = Integer.toString(i); // 각 자리수를 더하기 위해 N을 문자열로 바꿈

dalcon10028

import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int [][]a = new int[3][2];
        for(int i=0; i<a.length; i++)
            for(int j=0; j<a[0].length; j++)
            a[i][j] = sc.nextInt();
        
        if (a[0][0] == a[1][0]) { // 30 == 10

dalcon10028

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        sc.close();
        int count=1; // 몇 번째 숫자인지 세는 변수
        for(int i=666; ;i++){
            String numToString = Integer.toString(i);

dalcon10028

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        StringBuilder sb = new StringBuilder(); // 출력이 많으므로 사용합니다.
        int N = sc.nextInt();
        int [][]pos = new int[N][2];
        
        for(int i=0; i<N; i++){

dalcon10028

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        StringBuilder sb = new StringBuilder(); // 출력이 많으므로 사용합니다.
        int N = sc.nextInt();
        int [][]pos = new int[N][2];
        
        for(int i=0; i<N; i++){

dalcon10028

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        StringBuilder sb = new StringBuilder(); // 출력이 많으므로 사용합니다.
        int N = sc.nextInt();
        TreeSet<String> treeWords = new TreeSet<String>(); // 트리셋을 사용하여 자동중복 제거
        for (int i=0; i<N; i++)
            treeWords.add(sc.next());

dalcon10028

import java.util.*;

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

dalcon10028

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        StringBuilder sb = new StringBuilder();
        int N = sc.nextInt();
        String [][]member = new String[N][2];
        for(int i=0; i<N; i++){
            member[i][0] = sc.next(); // 나이

dalcon10028

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();
        Stack<Integer> stack = new Stack<>();
        for(int i=0; i<K; i++){
            int input = sc.nextInt();
            if(input==0) stack.pop();

dalcon10028

import java.util.*;

public class Main {
    static char field[][];
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        sc.close();
        field = new char[N][N];
        StringBuilder sb = new StringBuilder();