import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;

public class Problem5 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        String[] input = scanner.nextLine().split(";");

        int[] nums = new int[input.length];

        for (int i = 0; i < input.length; i++) {
            nums[i] = Integer.parseInt(input[i]);
        }

        bubbleSort(nums);

        reverseArr(nums);

        for (int i = 0; i <nums.length ; i++) {

            if (i %2 == 0){
                int temp = nums[i];
                temp*=10;
                nums[i] = temp;
            }
            else {
                int temp = nums[i];
                temp*=-10;
                nums[i] = temp;
            }

        }

        for (int num : nums) {
            System.out.print(num+"#");
        }

    }

    static int[] bubbleSort(int[] arr) {
        int n = arr.length;
        int temp = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 1; j < (n - i); j++) {
                if (arr[j - 1] > arr[j]) {
                    temp = arr[j - 1];
                    arr[j - 1] = arr[j];
                    arr[j] = temp;
                }

            }
        }
        return arr;
    }
    public static int[] reverseArr(int[] arr){

        for(int i = 0; i < arr.length / 2; i++)
        {
            int temp = arr[i];
            arr[i] = arr[arr.length - i - 1];
            arr[arr.length - i - 1] = temp;
        }

        return arr;
    }
}