#![allow(unused_imports)]
#![allow(non_snake_case)]
use std::collections::HashMap;
use std::collections::HashSet;
use std::collections::VecDeque;

#[allow(unused_macros)]
macro_rules! read {
    ([$t:ty] ; $n:expr) =>
        ((0..$n).map(|_| read!([$t])).collect::<Vec<_>>());
    ($($t:ty),+ ; $n:expr) =>
        ((0..$n).map(|_| read!($($t),+)).collect::<Vec<_>>());
    ([$t:ty]) =>
        (rl().split_whitespace().map(|w| w.parse().unwrap()).collect::<Vec<$t>>());
    ($t:ty) =>
        (rl().parse::<$t>().unwrap());
    ($($t:ty),*) => {{
        let buf = rl();
        let mut w = buf.split_whitespace();
        ($(w.next().unwrap().parse::<$t>().unwrap()),*)
    }};
}

#[allow(dead_code)]
fn rl() -> String {
    let mut buf = String::new();
    std::io::stdin().read_line(&mut buf).unwrap();
    buf.trim_end().to_owned()
}

fn main() {
    let s = read!(String).into_bytes();
    let minus = '-' as u8;
    let plus = '+' as u8;
    let zero = '0' as u8;
    let nine = '9' as u8;

    let mut index = 0;
    // left
    let mut left: i32 = 0;
    let mut left_sign = 1;
    if s[index] == minus { left_sign = -1; index += 1;}
    else if s[index] == plus {index += 1}
    while zero <= s[index] && s[index] <= nine {
        left *= 10;
        left += (s[index] - zero) as i32;
        index += 1;
    }
    left *= left_sign;

    let op = s[index];
    index += 1;

    let mut right: i32 = 0;
    let mut right_sign = 1;
    if s[index] == minus { right_sign = -1; index += 1;}
    else if s[index] == plus {index += 1}
    for i in index..s.len() {
        right *= 10;
        right += (s[i] - zero) as i32;
    }
    right *= right_sign;


    let ans = if op == plus { left - right} else {left + right};
    println!("{}", ans);
}