그룹 피드

# a, b, c = map(int, input().split())

# if b <= c < a or c <= b < a:

# print(b if b > c else c)

# elif a <= c < b or c <= a < b:

# print(a if a > c else c)

# elif a <= b < c or b <= a < c:

//#include<stdio.h>

//int q[3333333][3]={}, top=-1, w=-1, arr[1010][1010]={}, memo[1010][1010]={};

//void push(int a, int b, int c)

//{

// top++;

// q[top][0]=a;

//#include<iostream>

//

//using namespace std;

//

//#define MAX_V 100010

//#define MAX_E 400010

# data=[]

# n=int(input())

# for i in range(n):

# x=[0]*n

# data.append(x)

#

/*

#include<stdio.h>

int main()

{

int a,b,c;

scanf("%d %d %d",&a,&b,&c);

# import sys

# sys.setrecursionlimit(10**6)

#

#

# def bs(s, e, k):

# global a, n

#임포트 받기

import pygame, sys

from pygame.locals import *

import random, time

'''

프로젝트 설명서 [ 포트폴리오 ]

n=int(input())

a=[0]*100003

b=list(map(int,input().split()))

for i in range(n):

x=b[i]%100003

while True:

#include <stdio.h>

int main()

{

int p[5]={};

int q[5]={};

int i,a,temp;