import java.util.*;
import java.io.*;
public class Main{
    public static void main(String args[]){
        Scanner sc=new Scanner(System.in);
        int a=sc.nextInt(),b=sc.nextInt();
        if(b%a==0||a%b==0){
            System.out.println("Sao Multiplos");

        }else{
            System.out.println("Nao sao Multiplos");

        }
    }
}

import java.util.*;
import java.io.*;
public class Main{
    public static void main(String args[]){
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        System.out.printf("%d:%d:%d",n/3600,n%3600/60,n%3600%60);
    }

}

import java.util.*;
import java.io.*;
public class Main{
    public static void main(String args[]){
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int arr[]={100,50,20,10,5,2,1};
        System.out.println(n);
        for(int i:arr){
            System.out.printf("%d nota(s) de R$ %d,00\n",n/i,i);
            n%=i;
        }
    }
}

import java.util.*;
import java.io.*;
public class Main{
    public static void main(String args[]){
        Scanner sc=new Scanner(System.in);
        double a,b,c,d;
        a=sc.nextDouble();
        b=sc.nextDouble();
        c=sc.nextDouble();
        d=sc.nextDouble();
        double ans=Math.pow(a-c,2)+Math.pow(b-d,2);
        System.out.printf("%.4f",Math.sqrt(ans));
    }
}

import java.io.*;
import java.util.*;
public class Main{
    public static void main(String args[]){
        Scanner sc=new Scanner(System.in);
        int a=sc.nextInt();
        int b=sc.nextInt();
        int c=sc.nextInt();
        int d=sc.nextInt();
        System.out.printf("DIFERENCA = %d",a*b-c*d);
    }
}

import java.io.*;
import java.util.*;
public class Main{
    public static void main(String args[]){
        Scanner scan=new Scanner(System.in);
        int a=scan.nextInt();
        int b=scan.nextInt();
        System.out.println(a+b);
    }
}

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;

int main()
{
    int a,b;
    string val;
    cin>>a>>val>>b;
    long long ans=0;
    for(auto i:val){
        if(isdigit(i)){
            ans=ans*a+i-'0';
        }else{
            int t=i|0x20;
            ans=ans*a+t-'a'+10;
        }
    }
    string val2;
    while(ans){
        int t=ans%b;
        if(t<10){
            val2.push_back(t+'0');
        }else{
            val2.push_back(t+'A'-10);
        }
        ans/=b;
    }
    reverse(val2.begin(),val2.end());
    cout<<val2;
}

class Solution {
public:
    void wiggleSort(vector<int>& nums) {
        int n=nums.size();
        auto midptr=nums.begin()+n/2;
        nth_element(nums.begin(),midptr,nums.end());
        int mid=*midptr;
        #define A(x) nums[(x*2+1)%(n|1)]
        for(int i=0,j=0,k=n-1;i<=k;){
            if(A(i)>mid)swap(A(i++),A(j++));
            else if(A(i)<mid)swap(A(k--),A(i));
            else i++;
        }
    }
};

class Solution {
public:
    void sortColors(vector<int>& nums) {
        int i=0,j=0,k=nums.size()-1;
        while(i<=k){
            if(nums[i]<1){
                swap(nums[i++],nums[j++]);
            }else if(nums[i]>1){
                swap(nums[i],nums[k--]);
            }else i++;

        }
    }
};

#include <iostream>
#include <cstring>
#include <algorithm>
#include<queue>
using namespace std;
const int N = 1000;
int main()
{
    priority_queue<int,vector<int>,greater<int>> q;
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; i ++ ){
        int v;
        scanf("%d", &v);
        q.push(v);
    }
    int ans=0;
    while(q.size()){
        int a=q.top();
        q.pop();
        if(q.size()){
            int b=q.top();
            q.pop();
            ans+=a+b;
            q.push(a+b);
        }
    }
    cout<<ans<<endl;

}