/*
import java.util.*;
public class Main{
public Main() {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int count =0;
for(;;) {
if(n>=500) {
n=n-500;
count ++;
}
else if(n<500 && n>=100) {
n=n-100;
count ++;
}
else if(n<100 && n>=50) {
n=n-50;
count ++;
}
if(n<50 && n>=10) {
n=n-10;
count ++;
}
if(n==0) {
break;
}
}
System.out.println(count);
}
public static void main(String[] args) {
new Main();
}
}
*/
/*
import java.util.*;
public class Main{
public Main() {
Scanner s = new Scanner(System.in);
int [] arr = new int [3];
for(int i=0; i<arr.length; i++) {
arr[i]=s.nextInt(); //0 = 배열의 크기 , 1=숫자가 더해지는 횟수, 2= 큰 수의 법칙 k
}
int [] brr = new int [arr[0]];
for(int i=0; i<brr.length; i++) {
brr[i]=s.nextInt();
}
Arrays.sort(brr);
int sum=0;
while(arr[1]!=0) {
for(int i=0; i<arr[2]; i++) {
sum+=brr[0];
}
sum += brr[1];
arr[1]-=arr[2];
}
System.out.print(sum);
}
//max에 가장 큰 수
public static void main(String[] args) {
new Main();
}
}
*/
/*
import java.util.*;
public class Main{
public Main() {
Scanner s = new Scanner(System.in);
int [][] arr;
int n = s.nextInt();
int m = s.nextInt();
int [] arr1 = new int [m];
int [] brr1 = new int [m];
arr = new int [n][m];
for(int i=0; i<n; i++) {
for(int j=0; j<m; j++) {
arr[i][j]=s.nextInt();
}
}
for(int i=0; i<n; i++) {
for(int j=0; j<m; j++) {
arr1[j] = arr[i][j];
}
Arrays.sort(arr1);
brr1[i]=arr1[0];
}
Arrays.sort(brr1);
System.out.println(brr1[m-1]);
}
public static void main(String [] args) {
new Main();
}
}
*/
/*
import java.util.*;
public class Main{
public Main() {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
int k = s.nextInt();
int count =0;
while(n!=1) {
if(n%k==0) {
n=n/k;
count ++;
}
else {
n -= 1;
count ++;
}
}
System.out.print(count);
}
public static void main(String[] args) {
new Main();
}
}
*/
/* 질문
import java.util.*;
public class Main{
public Main() {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
int x=1;
int y=1;
String al= s.next() ;
String[] sl = new String[al.length()];
sl=al.split(" ");
for(int i=0; i<sl.length; i++) {
if(sl[i].equals("R")&&x!=n) {
x++;
}else if(sl[i].equals("U")&&y!=1) {
y--;
}else if(sl[i].equals("D")&&y!=n) {
y++;
}else if(sl[i].equals("L")&&x!=1){
x--;
}
}
System.out.print(x+" "+y);
}
public static void main(String [] args) {
new Main();
}
}
*/
/* 완전탐색함 다른 방법을 원함
import java.util.*;
public class Main{
public Main() {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
int count=0;
int i=0;
int [] arr = new int[6];
for(int j=0; j<6; j++) {
if(j%2==0&&j<=4) {
while(arr[j]!=10) {
arr[j]+=1;
if(arr[j]==3){
count ++;
}
}
}else {
while(arr[j]!=6) {
arr[j]+=1;
}if(arr[j]==3) {
count++;
}
}
}
}
public static void main(String[] args) {
new Main();
}
}
*/
import java.util.*;
class LinkedList{
class Node{
private int data;
private Node next;
Node (int data, Node Next){
this.data = data;
this.next = next;
}
}
private Node head;
private Node crnt;
private Node tail;
public void add(int x) {
Node v = new Node(x, null);
v.next = head.next;
crnt.next = v;
head.next = v;
}
public LinkedList() {
head.next = tail;
crnt.next = tail;
tail=null;
}
}
public class Main{
public static void main(String[] args) {
LinkedList data = new LinkedList();
Scanner s = new Scanner(System.in);
while(true) {
int v = s.nextInt();
data.add(v);
}
}
}