program sort { int[] load() int[] res; int c,num,in; { print('l'); print('?'); read(num); res = new int[num]; c = 0; while (c 0 && t < arr[j-1]) { arr[j]=arr[j-1]; j = j - 1; } arr[j] = t; i++; } } void main() int[] arr; { arr = load(); printar(arr); sort(arr); printar(arr); } }