[Algorithm] 데일리 백준

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.Objects;

public class Main {

  public static void main(String[] args) throws Exception {

    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
    StringBuilder sb = new StringBuilder();

//    // 2908
//    // 숫자열 가져오기
//    String[] testCase = br.readLine().split("");
//    String[] reverse = new String[testCase.length];
//    // 숫자열 전부 뒤집기
//    for(int i = 0; i < testCase.length; i++){
//      for (int j = testCase.length - 1 - i ; j >= 0 ; j--) {
//        reverse[j] = testCase[i];
//      }
//    }
//    // 크기 비교
//    if(Integer.parseInt(reverse[0]) > Integer.parseInt(reverse[4])){
//      sb.append(reverse[0]+reverse[1]+reverse[2]);
//    } else if((Integer.parseInt(reverse[0]) == Integer.parseInt(reverse[4])) && (Integer.parseInt(reverse[1]) > Integer.parseInt(reverse[5]))){
//      sb.append(reverse[0]+reverse[1]+reverse[2]);
//    } else if((Integer.parseInt(reverse[0]) == Integer.parseInt(reverse[4])) && (Integer.parseInt(reverse[1]) == Integer.parseInt(reverse[5])) && (Integer.parseInt(reverse[2]) > Integer.parseInt(reverse[6]))){
//      sb.append(reverse[0]+reverse[1]+reverse[2]);
//    } else {
//      sb.append(reverse[4]+reverse[5]+reverse[6]);
//    }
//
//    System.out.println(sb);


//    // 5622
//    String[] words = br.readLine().split("");
//    int result = 0;
//    for (int i = 0; i < words.length; i++) {
//      if(words[i].equals("A") || words[i].equals("B") || words[i].equals("C")){
//        result += 3;
//      } else if (words[i].equals("D") || words[i].equals("E") || words[i].equals("F")) {
//        result += 4;
//      } else if (words[i].equals("G") || words[i].equals("H") || words[i].equals("I")) {
//        result += 5;
//      } else if (words[i].equals("J") || words[i].equals("K") || words[i].equals("L")) {
//        result += 6;
//      } else if (words[i].equals("M") || words[i].equals("N") || words[i].equals("O")) {
//        result += 7;
//      } else if (words[i].equals("P") || words[i].equals("Q") || words[i].equals("R") || words[i].equals("S")) {
//        result += 8;
//      } else if (words[i].equals("T") || words[i].equals("U") || words[i].equals("V")) {
//        result += 9;
//      } else if (words[i].equals("W") || words[i].equals("X") || words[i].equals("Y") || words[i].equals("Z")) {
//        result += 10;
//      }
//    }
//    System.out.println(result);

    // 11718
    try {
      String wordLine;
      while((wordLine = br.readLine()) != null){
        sb.append(wordLine + "\n");
        if(wordLine.equals("")){
          break;
        }
      }
      System.out.println(sb);
    } finally {
      br.close();
    }

  }
}