package stefi;

import java.util.Scanner;

public class Iskam6 {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		String[] numbers = scan.next().split(", ");
		int[] nums = new int[numbers.length];
		for (int i = 0; i < nums.length; i++) {
			nums[i] = Integer.parseInt(numbers[i]);
		}
		int max = nums[0];
		int min = nums[0];

		for (int i = 0; i < nums.length; i++) {
			if (max < nums[i]) {
				max = nums[i];
			}
			if (max > nums[i]) {
				max = nums[i];
			}
		}
		int sum = max + min;
		BubbleSortArray(nums);
		System.out.println("Sorted array: ");
		for (int n : nums) {
			System.out.print(n + " ");

		}
		System.out.println();
		System.out.println("Sum = " + sum);
		if (LinearSearch(nums, 15) == -1) {
			System.out.println("Not found");
		} else {
			System.out.println("Index = " + LinearSearch(nums, 15));
		}
	}

	static void BubbleSortArray(int[] array) {
		for (int j = 0; j < array.length; j++) {
			for (int i = 0; i < array.length; i++) {
				if (array[i] < array[i + 1]) {
					int temp = array[i];
					array[i] = array[i + 1];
					array[i + 1] = temp;
				}
			}
		}
	}

	static int LinearSearch(int[] arr, int num) {
		for (int i = 0; i < arr.length; i++) {
			if (arr[i] == num) {
				return 1;
			}
		}
		return -1;
	}
}