A + B is often used as an example of the easiest problem possible to show some contest platform. However, some scientists have observed that sometimes this problem is not so easy to get accepted. Want to try?

Input

The input contains two integers a and b (0 ≤ a, b ≤ 103), separated by a single space.

Output

Output the sum of the given integers.

Examples

Input

5 14


Output

19


Input

381 492


Output

873
import sun.misc.Compare;

import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;
import java.util.Calendar.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;

import static java.math.BigInteger.*;

public class Main {

    double tBeg;
    PrintWriter err;

    void run(){
        //        try {
        //            br = new BufferedReader(new InputStreamReader(System.in));
        //            out = new PrintWriter(new OutputStreamWriter(System.out));
        //            br = new BufferedReader(new FileReader("input.txt"));
        //            out = new PrintWriter(new FileWriter("output.txt"));


        boolean oj = System.getProperty("ONLINE_JUDGE") != null;
        Locale.setDefault(Locale.US);
        //oj = true;
        try{
            err = new PrintWriter(new OutputStreamWriter(System.err));
            if( oj ){
                br = new BufferedReader(new InputStreamReader(System.in));
                out = new PrintWriter(new OutputStreamWriter(System.out));
            }
            else{
                br  = new BufferedReader(new FileReader("input.txt" ));
                //                br  = new BufferedReader(new FileReader("C:/inp.txt" ));
                out = new PrintWriter   (new FileWriter("output.txt"));
            }
        }catch(Exception e){
            MLE();
        }
        tBeg = System.currentTimeMillis();
        solve();
        if( !oj )out.println( "TIME: " + (System.currentTimeMillis() - tBeg ) / 1e3 );
        exit(0);
    }

    void exit( int val ){
        out.close();
        System.exit(val);
    }

    StringTokenizer st;
    BufferedReader br;
    PrintWriter out;

    String readLine(){
        try {
            return br.readLine();
        } catch (IOException e) {
            return null;
        }
    }

    String next(){
        while( st==null || !st.hasMoreElements() )
            st = new StringTokenizer(readLine());
        return st.nextToken();
    }

    int nextInt(){ return Integer.parseInt(next()); }
    long nextLong(){ return Long.parseLong(next()); }
    double nextDouble(){ return Double.parseDouble(next()); }

    void MLE(){
        int[][] arr = new int[1024*1024][]; for( int i = 0; i < 1024*1024; ++i ) arr[i] = new int[1024*1024];
    }

    void TLE(){
        for(;;);
    }

    public static void main(String[] args) {
        new Main().run();

        //        new Thread(null, new Runnable() {
        //            public void run() {
        //                try {
        //                    new Main().run();
        //                } catch (Exception e) {
        //                    int[][] arr = new int[1024*1024][]; for( int i = 0; i < 1024*1024; ++i ) arr[i] = new int[1024*1024];
        //                }
        //            }
        //        }, "LOLOL", 200 * (1<<20)).start();
    }
    ////////////////////////////////////////////////////////////////




    void solve() {
        int a = nextInt();
        int b = nextInt();
        out.println( a + b );

//        if( a == 381 ) {
//            out.println( "873" );
//            return;
//        }

//        out.println( 19 );
//        out.println( a ^ b );
//        out.println( a | b );
//        out.println( Integer.toBinaryString(a) );
//        out.println( Integer.toBinaryString(b) );
//        out.println( Integer.toBinaryString(a+b) );
    }


}
