import java.util.Arrays;import java.util.*;public class NumbersList { private static int array[]=new int[0]; public static void append(int val){ int buffer[] = new int[array.length +1]; for (int n = 0;n<=array.length-1;n++){ buffer[n]=array[n]; } buffer[buffer.length-1]= val; array=buffer; } public static int count(){ return array.length; } public static void print(){ for(int n=0;n<=array.length-1;n++) System.out.println(array[n]); } public static int sum(){ int sum=0; for(int n=0;n<=array.length-1;n++){ sum+=array[n]; } return sum; } public static void insert(int val,int pos){ int buffer[] = new int[array.length +1]; for (int n = 0;n<=pos;n++){ buffer[n]=array[n]; } for (int n = pos+1; n<buffer.length;n++){ buffer[n]=array[n-1]; } buffer[pos]=val; array=buffer; } public static void remove(int val){ for (int n = 0;n<=array.length-1;n++){ if (array[n]==val){ array[n]=0; } } } public static void reverse(){ int buffer[] = new int[array.length]; for (int n = 0;n<=array.length-1;n++){ buffer[n]=array[array.length-1-n]; } array=buffer; } public static void sort(){ Arrays.sort(array); } public static void main(String[] args){ Scanner scan = new Scanner(System.in); int i=0; while(true){ i = scan.nextInt(); if (i==-1) { print(); break; } append(i); } System.out.println("Array Size="+count()); System.out.println("Sum="+sum()); insert(10,2); print(); System.out.println("Removing 10"); remove(10); print(); System.out.println("Reversing order"); reverse(); print(); System.out.println("Sorting Array"); sort(); print(); }}