/*
import java.util.*;
class circle{
int front=0;
int rear=0;
int max=0;
int q[];
public circle(int capacity) {
try {
max = capacity;
q=new int[max];
}catch(OutOfMemoryError e) {
max = 0;
}
}
public void enqueue(int x) {
q[front]=x;
front ++;
front = front % max;
if(rear==front) {
System.out.println("full");
}
}
public void dequeue() {
rear++;
rear = rear%max;
if(rear==front) {
System.out.println("empty");
}
}
public void view() {
for(int i=0; i<max; i++) {
System.out.print(q[i]);
if(i==max-1)System.out.print("\n");
}
}
}
class queue{
int front=0;
int rear=0;
int max=0;
int q[];
public queue(int capacity){
try {
max = capacity;
q = new int[max];
}catch(OutOfMemoryError e) {
max=0;
}
}
public int enqueue(int x){
return q[front++]=x;
}
public void dequeue() {
q[rear++]=0;
if(rear==front) {
System.out.print("비어있습니다");
rear=0;
front=0;
}
}
public void view() {
for(int i=0; i<max; i++) {
System.out.print(q[i]);
if(i==max-1)System.out.print("\n");
}
}
public void clean() {
for(int i=rear; i<front; i++) {
for(int j=0; j<front-rear; j++) {
q[j]=q[i];
}
}
front = front-rear;
rear=0;
}
}
public class Main{
public Main() {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
circle c = new circle(n);
for(int i=0 ; i<n; i++) {
int x = scan.nextInt();
c.enqueue(x);
c.view();
}
for(int i=0; i<5; i++) {
c.dequeue();
}
c.view();
}
public static void main(String[] args) {
new Main();
}
}
*/
import java.util.*;
class LinkedList<E>{
class Node<E>{
private E data;//데이터
private Node<E> next;
Node(E data, Node<E> next){
this.data= data;
this.next= next;
}
}
private Node<E> head;
private Node<E> crnt;
}
public class Main{
public Main() {
}
public static void main(String[] args) {
new Main();
}
}