developer-sdk

import java.util.Arrays;
import java.util.Scanner;

/**
 * 백준, 1916, 최소비용 구하기
 * 
 * @author whitebeard
 *
 */
public class Problem1916 {

developer-sdk

import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;

/**
 * 백준, 1005, ACM Craft
 * 
 * @author whitebeard
 *
 */

developer-sdk

import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;

public class Main {

	static int N;
	static int[] cost;
	static int[] in;
	static int[] result;

developer-sdk

import java.util.Scanner;

/**
 * 백준, 집합의 표현, 1717
 * 
 * @author User
 *
 */
public class Main {

developer-sdk

import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;

/**
 * 백준, 1197 최소 스패닝 트리 크루스칼 알고리즘
 * 
 * @author User
 *
 */

developer-sdk

import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;

/**
 * 백준 11437
 * LCA(Longest Common Ancetor)
 * 
 * @author whitebeard-k
 *

developer-sdk

import java.util.Scanner;

/**
 * 백준, 5721, 사탕줍기
 * 
 * @author whitebeard-k
 *
 */
public class Problem5721 {

developer-sdk

import java.util.Arrays;
import java.util.Scanner;

/**
 * 백준, 1504, 특정한 최단 경로
 * 다익스트라 알고리즘 
 * 
 * @author whitebeard
 *
 */

developer-sdk

import java.util.Scanner;

/**
 * 백준, 11404
 * 플로이드
 * 
 * @author whitebeard-k
 *
 */
public class Problem11404 {

developer-sdk

import java.util.Scanner;

public class Problem1463 {
	static int[] d = new int[100];

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		sc.close();