jiahuimbzuai/CoQuIR huggingface dataset:
//  [cpp]
#include <cstdio>
#include<cstring>
int main(){
    char s[200000];
    scanf("%s",s);
    int len=strlen(s);
    int sum=0;
    for(int i=0;i<len;i++) sum+=s[i]-'0';
    if(sum%9==0){
        puts("Yes");
    }else{
        puts("No");
    }
}

/*
#include <iostream>
int64_t mul_9(int64_t n){
    int64_t sum=0;
    //std::cin >> n;
    while(n!=0){
        sum=sum+n%10;
        std::cout <<" "<<sum<<std::endl;
        n=n/10;
        std::cout <<" "<<n<<std::endl;
    }
    
    return sum;
}
int main(){
    int64_t n,sum;
    std::cin >> n;
    sum=mul_9(n);
    //std::cout <<sum<<std::endl;
    if(sum%9==0){
        std::cout <<"Yes"<<std::endl;
    }else{
        std::cout <<"No" <<std::endl;
    }
    return 0;
}
*/
//  [cpp]
#include<stdio.h>
#include<string.h>
int main()
{
	char n[200001];
	long long int i,m=0,len;
	scanf("%s",n);
	len=strlen(n);
	for(i=0;i<len;i++){
		m+=(n[i]-'0');
	}
	if(m%9==0){
		printf("Yes\n");
	}
	else{
		printf("No\n");
	}
	return 0;
}
//  [cpp]
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define REP(i, start, end) for (ll i = start, i##Len = (end); i < i##Len; ++i)
#define REPR(i, start, end) for (ll i = start, i##Len = (end); i > i##Len; --i)
using ll = long long;
using namespace std;

int main()
{
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);

    string s;
    cin >> s;
    ll total = 0;
    for (auto &c : s)
        total += c - '0';
    cout << (total % 9 == 0 ? "Yes" : "No") << endl;
}
//  [cpp]
#include <bits/stdc++.h>
using namespace std;

int main() {
  
  long long N;
  cin >> N;
  long long K = 0;
  long long i = 0;
  long long j = 10;
  while(N != 0){
    K += N % j;
    N /= j;
    j *= 10;
    i++;
}
  if(K % 9 == 0){cout << "Yes" << endl;}
  else{cout << "No" << endl;}
  
}
//  [cpp]
#include <bits/stdc++.h>
using namespace std;

int main() {
  
  long long N;
  cin >> N;
  int K = 0;
  int i = 0;
  int j = 10;
  while(N != 0){
    K += N % j;
    N /= j;
    j *= 10;
    i++;
}
  if(K % 9 == 0){cout << "Yes" << endl;}
  else{cout << "No" << endl;}
  
}
//  [c]
#include <stdio.h>

int main(){
    int c;
    int total;
    while((c=getchar())!='\n'){
        total += c-'0';
    }
    if(total%9==0){
        printf("Yes\n");
    }else{
        printf("No\n");
    }
}
//  [c]
#include<stdio.h>
int main(){
	char n[200000];
	int cnt = 0;
	scanf("%s", &n);
	for(int i=0;n[i]!='\0';i++){
		cnt += n[i]-'0';
	}
	printf("%s\n", cnt%9==0?"Yes":"No");
	return 0;
}
//  [c]
#include <stdio.h>

int main(){
    int c;
    long long sum;
    while((c=getchar())!='\n'){
        sum += c-'0';
    }
    if(sum%9==0){
        printf("Yes\n");
    }else{
        printf("No\n");
    }
}
//  [c]
#include<stdio.h>
int main(void){
  long N;
  scanf("%ld",&N);
  if(N % 9==0)
    printf("Yes");
  else
    printf("No");
  return 0;
}
//  [c]
#include<stdio.h>
int main(void){
  int N;
  scanf("%d",&N);
  if(N % 9==0)
    printf("Yes");
  else
    printf("No");
  return 0;
}
//  [c]
#include<stdio.h>
#include<string.h>
int main(void){
  char n[200001];
  scanf("%s",n);
  int i=strlen(n);
  int s=0;
  for(int j=0;j<s;j++){
    s+=n[j]-48;
  }
  if(s%9==0){
    printf("Yes\n");
  }else{
    printf("No\n");
  }
  return 0;
}
//  [javascript]
'use strict'
 
function main(s) {
  s = s.replace(/\r?\n/g,'');
  s = s.split('');
  let kekka = 0;
  for(var i = 0; i < s.length;i++){
    kekka += Number(s[i]); 
  }

  if(kekka % 9 == 0){
    console.log("Yes");
  }else{
    console.log("No");
  }
}
 
main(require("fs").readFileSync("/dev/stdin", "utf8"));
//  [javascript]
function Main(input) {
  input = input.replace(/\n/g, ' ').split(" ");
  var a = input[0];
  var ans = 0;
  var mem = 0;
  for(var i=0;i<a.length;i++){
    ans+=+a.slice(i,i+1);
  }
  console.log((ans%9==0)?"Yes":"No");
}
Main(require("fs").readFileSync("/dev/stdin", "utf8"));
//  [javascript]
const input = require("fs").readFileSync("/dev/stdin", "utf8")

const lines = input.split('\n')
let N = lines[0].trim()

let sum = 0
for (let i = 0; i < N.length; i++) {
    sum += N[i] - 0
}

console.log(sum % 9 === 0 ? 'Yes' : 'No')
//  [javascript]
// inputに入力データ全体が入る
function Main(input) {
	input = input.split("");
  	let result = 0;	
  	for(let i =0; i< input.length ; i++){
    	result += parseInt(input[i], 10);  
    }

  	if(result % 9 === 0 ){
      console.log("Yes");
    }else{
      console.log("No");
    }
}
//*この行以降は編集しないでください（標準入出力から一度に読み込み、Mainを呼び出します）
Main(require("fs").readFileSync("/dev/stdin", "utf8"));
//  [javascript]
// inputに入力データ全体が入る
function Main(input) {
	input = input.split("");
  	let result = 0;	
  	for(let i =0; i< input.length ; i++){
    	result += parseInt(input[i], 10);  
    }
  	if(result % 9 === 0 ){
      console.log('Yes')
    }else{
      console.log('No')
    }
}
//*この行以降は編集しないでください（標準入出力から一度に読み込み、Mainを呼び出します）
Main(require("fs").readFileSync("/dev/stdin", "utf8"));
//  [javascript]
// inputに入力データ全体が入る
function Main(input) {
	input = input.split("");
  	let result = 0;	
  	for(let i =0; i< input.length ; i++){
    	result += parseInt(i, 10);  
    }
  	if(result % 9 === 0 ){
      console.log('Yes')
    }else{
      console.log('No')
    }
}
//*この行以降は編集しないでください（標準入出力から一度に読み込み、Mainを呼び出します）
Main(require("fs").readFileSync("/dev/stdin", "utf8"));
//  [go]
package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

func configure(scanner *bufio.Scanner) {
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 1000005), 1000005)
}
func getNextString(scanner *bufio.Scanner) string {
	scanned := scanner.Scan()
	if !scanned {
		panic("scan failed")
	}
	return scanner.Text()
}
func getNextInt(scanner *bufio.Scanner) int {
	i, _ := strconv.Atoi(getNextString(scanner))
	return i
}
func getNextInt64(scanner *bufio.Scanner) int64 {
	i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
	return i
}
func getNextFloat64(scanner *bufio.Scanner) float64 {
	i, _ := strconv.ParseFloat(getNextString(scanner), 64)
	return i
}
func main() {
	fp := os.Stdin
	wfp := os.Stdout
	extra := 0
	if os.Getenv("I") == "IronMan" {
		fp, _ = os.Open(os.Getenv("END_GAME"))
		extra = 100
	}
	scanner := bufio.NewScanner(fp)
	configure(scanner)
	writer := bufio.NewWriter(wfp)
	defer func() {
		r := recover()
		if r != nil {
			fmt.Fprintln(writer, r)
		}
		writer.Flush()
	}()
	solve(scanner, writer)
	for i := 0; i < extra; i++ {
		fmt.Fprintln(writer, "-----------------------------------")
		solve(scanner, writer)
	}
}
func solve(scanner *bufio.Scanner, writer *bufio.Writer) {
	s := getNextString(scanner)
	n := len(s)
	var sum int
	for i := 0; i < n; i++ {
		sum += int(s[i] - '0')
	}
	if sum%3 == 0 {
		fmt.Fprintln(writer, "Yes")
		return
	}
	fmt.Fprintln(writer, "No")
}
//  [go]
package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"sync"
)

func main() {
	n := scanRowText()
	result := 0
	for _, v := range n {
		d, _ := strconv.Atoi(string(v))
		result += d
		result %= 9
	}
	if result == 0 {
		fmt.Println("Yes")
		return
	}
	fmt.Println("No")
}

var once sync.Once
var scanner *bufio.Scanner

func scanRowText() string {
	once.Do(func() {
		scanner = bufio.NewScanner(os.Stdin)
		scanner.Split(bufio.ScanWords)
	})
	scanner.Scan()
	return scanner.Text()
}
//  [go]
package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

func nextLine(r *bufio.Reader) string {
	var buf []byte
	for {
		line, isPrefix, err := r.ReadLine()
		if err != nil {
			panic(err)
		}
		buf = append(buf, line...)
		if !isPrefix {
			break
		}
	}
	return string(buf)
}

func nextStr(s *bufio.Scanner) string {
	s.Scan()
	ref := s.Bytes()
	cp := make([]byte, len(ref))
	copy(cp, ref)
	return string(cp)
}

func nextInt(s *bufio.Scanner) int {
	n, err := strconv.Atoi(nextStr(s))
	if err != nil {
		panic(err)
	}
	return n
}

func nextInt64(s *bufio.Scanner) int64 {
	n, err := strconv.ParseInt(nextStr(s), 0, 64)
	if err != nil {
		panic(err)
	}
	return n
}

func main() {
	r := bufio.NewReader(os.Stdin)
	s := bufio.NewScanner(os.Stdin)
	s.Split(bufio.ScanWords)

	str := nextLine(r)
	sum := 0
	for _, c := range str {
		sum += int(c)
	}

	if sum % 9 == 0 {
		fmt.Println("Yes")
	} else {
		fmt.Println("No")
	}
}
//  [go]
//go:generate echo "https://atcoder.jp/contests/abc176/tasks/abc176_b"
package main

import (
	"bufio"
	"fmt"
	"io"
	"math/big"
	"os"
	"strconv"
)

type scanner struct{ *bufio.Scanner }

func newScanner(r io.Reader) *scanner {
	s := bufio.NewScanner(r)
	s.Split(bufio.ScanWords)
	s.Buffer(nil, 100000000)
	return &scanner{s}
}

func (s *scanner) String() string {
	s.Scan()
	return s.Text()
}

func (s *scanner) StringSlice(l int) []string {
	if l == 0 {
		return []string{}
	}
	sl := make([]string, l, l)
	for i := range sl {
		sl[i] = s.String()
	}
	return sl
}

func solve(n string) bool {
	sum := 0
	for _, c := range n {
		n, _ := strconv.Atoi(string(c))
		sum += n
	}
	return sum%9 == 0
}

func solve2(n *big.Int) bool {
	z := big.NewInt(0)
	t := big.NewInt(10)

	sum := int64(0)
	for n.Cmp(z) > 0 {
		m := new(big.Int)
		n, m = new(big.Int).DivMod(n, t, m)
		sum += m.Int64()
	}
	return sum%9 == 0
}

func (s *scanner) BigInt() *big.Int {
	s.Scan()
	n, _ := strconv.ParseInt(s.Text(), 10, 64)
	return big.NewInt(n)
}

func (s *scanner) BigIntSlice(l int) []*big.Int {
	if l == 0 {
		return []*big.Int{}
	}
	sl := make([]*big.Int, l, l)
	for i := range sl {
		sl[i] = s.BigInt()
	}
	return sl
}

func main() {
	scan := newScanner(os.Stdin)
	n := scan.BigInt()
	if solve2(n) {
		fmt.Println("Yes")
	} else {
		fmt.Println("No")
	}
}
//  [ruby]
n = gets.chomp.to_i

if n % 9 == 0
  puts "Yes"
else
  puts "No"
end
//  [ruby]
input = gets.to_i

if((input % 9 ) == 0)
  puts 'Yes'
else
  puts 'No'
end
//  [ruby]
puts gets.to_i%9>0?"No":"Yes"
//  [ruby]
input_line = gets
sum = 0
input_line.downto(0) do
  sum += input_line%10
  input_line /= 10
end
if sum%9 == 0
  p "Yes"
else
  p "No"
end
//  [ruby]
input = gets.to_i
array = []

while input != 0
  array << (input % 10)
  input /= 10
end

total = 0
for num in array
  total += num
end

if((total % 9) == 0)
  puts 'Yes'
else
  puts 'No'
end
//  [ruby]
gets.divmod(9).last > 0 ? :No : :Yes
//  [rust]
fn main() {
    let s = {
        let mut s = String::new();
        std::io::stdin().read_line(&mut s).unwrap();
        s.trim_right().to_owned()
    };

    let n_string = {
        let mut ws = s.split_whitespace();
        let n_string: String = ws.next().unwrap().parse().unwrap();
        n_string
    };

    let mut sum: i32 = 0;

    for i in n_string.as_str().chars() {
        let num : i32 = i as i32 - 48;
        sum += num;
    }

    if sum % 9 == 0 {
        println!("Yes");
    } else {
        println!("No");
    }
}
//  [rust]
use proconio::{fastout, input};

#[fastout]
fn main() {
    input! {
        s: String,
    }

    let mut sum = 0i64;
    for d in s.chars() {
        let d: i64 = d.to_digit(10).unwrap() as i64;
        sum += d;
    }

    let ans = if sum % 9 == 0 { "Yes" } else { "No" };
    println!("{}", ans);
}
//  [rust]
#[allow(unused_imports)]
use proconio::{input, marker::*};

#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};

#[allow(unused_imports)]
use std::io::Write;

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        #[cfg(debug_assertions)]
        writeln!(&mut std::io::stderr(), concat!("[DEBUG] ", $(stringify!($a), "={:?} "),*), $($a),*).unwrap();
    }
}

fn main() {
    input! {
        n: String,
    }
    let mut sum = 0usize;
    for c in n.chars() {
        sum += c as usize - '0' as usize;
    }
    if sum % 9 == 0 {
        println!("Yes");
    } else {
        println!("No");
    }
}
//  [rust]
#include <iostream>
#include <string>

using namespace std;

int main(){

    string input = "";

    cin >> input;

    long long digit_sum = 0;

    for(char x : input){

        digit_sum += x - '0';

    }

    if(digit_sum%9 == 0){
        cout <<"Yes\n";
    }else{
        cout <<"No\n";
    }

    
    return 0;
}
//  [rust]
use std::io;

fn main(){


    let mut input: String = String::new();

    io::stdin().read_line(&mut input).expect("Enter Something");

    let mut input_num:i128 = input.trim().parse().unwrap();

    
    let mut digit_sum: i128 = 0;

    while input_num > 0{
        digit_sum += input_num%10;
        input_num = input_num/10;
    }
    
    println!("{}", {
        if digit_sum%9 == 0{"YES"}
        else {"NO"}
    });

}
//  [rust]
use proconio::input;
 
fn main() {
    input! {
        n : String,
    }

    let mut itr = n.split("");

    let mut cal = 0;

    for s in itr {
        cal += s.parse().unwrap();
    }
  
    if cal / 9 == 0 {
        println!("Yes");
    } else {
        println!("No");
    }
 
}
//  [swift]
let s = readLine()!

var sum = 0
for c in s {
  sum += Int(String(c))!
}
print(sum % 9 == 0 ? "Yes" : "No")
//  [swift]
import Foundation

let input_line: String = readLine()!
var sum = 0

for num in input_line{
    sum += Int(String(num))!
}

if (sum % 9 == 0) {
    print("Yes")
}else{
    print("No")
}
//  [swift]
func mainB() {
    let N = readLine()!

    let sum = N.reduce(0) { (sum, part) in sum + Int(String(part))! }
    print(sum.isMultiple(of: 9) ? "Yes" : "No")
}
mainB()
//  [swift]
// 🐋💭
import Foundation

func readInts() -> [Int] {
    return readLine()!.split(separator: " ").map { Int($0)! }
}

func readInt() -> Int {
    return Int(readLine()!)!
}

func readDoubles () -> [Double] {
    return readLine()!.split(separator: " ").map { Double($0)! }
}

func readDouble() -> Double{
    return Double(readLine()!)!
}

func readLines() -> [String] {
    return readLine()!.map { String($0) }
}
///最大公約数を返す
func gcd(_ m:Int, _ n:Int) -> Int {
    if n == 0 {return m}
    return gcd(n, m % n)
}

///最大公約数を返す
func gcd(_ array: [Int]) -> Int {
    var value = array[0]
    if array.count > 1 {
        for i in 1..<array.count {
            value = gcd(value, array[i])
        }
    }
    return value
}

///最小公倍数を返す
func lcm(_ m:Int, _ n:Int) -> Int {
    return m * n / gcd(m, n)
}

///素数判定(試し割り)
func isPrime(_ x:Int) -> Bool {
    if x <= 1 || x % 2 == 0 { return false }
    if x == 2 { return true }
    for i in stride(from: 3, to: Int(ceil(sqrt(Double(x)))), by: 2){
        if x % i == 0 {
            return false
        }
    }
    return true
}

//https://program-life.com/669
///実行速度の計測
func exectionTime(action: () -> Void) {
    let startDate = Date()
    action()
    let endDate = Date()
    print(endDate.timeIntervalSince(startDate))
}

//https://riptutorial.com/ja/swift/example/14738/インデックスを知らずに配列から要素を削除する
extension Array where Element: Equatable {
    
    mutating func remove(_ element: Element) {
        _ = firstIndex(of: element).flatMap {
            self.remove(at: $0)
        }
    }
}

func binarySearch(rifgt:Int, key:Int, ary:[String]) -> Int{
    var left = 0
    var right = rifgt
    
    while abs(right - left) > 1 {
        let mid = left + (right - left) / 2
        
        if Int(ary[mid])! < key {
            left = mid
            
        } else {
            right = mid
        }
    }
    return left
}

func arrangement (prev:String, ary:[String], returnVal:[String]) -> [String] {
    var returnVal = returnVal
    if ary.count == 0 {
        returnVal.append(prev)
        return returnVal
    }
    
    for s in ary {
        let wprev = prev + s
        var wary = ary
        wary.remove(s)
        returnVal = arrangement(prev: wprev, ary: wary, returnVal: returnVal)
    }
    return returnVal
}
// https://algo-logic.info/divisor/
/// 約数の配列を返す
func divisor(_ n:Int) -> [Int] {
    var ret = [Int]()
    var i = 1
    while i * i <= n {
        if n % i == 0 {
            ret.append(i)
            if i * i != n {
                ret.append(n / i)
            }
        }
        i += 1
    }
    return ret.sorted()
}

func main() {
    let N = readInt()
    //＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿ここまで入力
    print(N % 9 == 0 ? "Yes": "No")
}
main()
//  [swift]
// 🐋💭
import Foundation

func readInts() -> [Int] {
    return readLine()!.split(separator: " ").map { Int($0)! }
}

func readInt() -> Int {
    return Int(readLine()!)!
}

func readDoubles () -> [Double] {
    return readLine()!.split(separator: " ").map { Double($0)! }
}

func readDouble() -> Double{
    return Double(readLine()!)!
}

func readLines() -> [String] {
    return readLine()!.map { String($0) }
}
///最大公約数を返す
func gcd(_ m:Int, _ n:Int) -> Int {
    if n == 0 {return m}
    return gcd(n, m % n)
}

///最大公約数を返す
func gcd(_ array: [Int]) -> Int {
    var value = array[0]
    if array.count > 1 {
        for i in 1..<array.count {
            value = gcd(value, array[i])
        }
    }
    return value
}

///最小公倍数を返す
func lcm(_ m:Int, _ n:Int) -> Int {
    return m * n / gcd(m, n)
}

///素数判定(試し割り)
func isPrime(_ x:Int) -> Bool {
    if x <= 1 || x % 2 == 0 { return false }
    if x == 2 { return true }
    for i in stride(from: 3, to: Int(ceil(sqrt(Double(x)))), by: 2){
        if x % i == 0 {
            return false
        }
    }
    return true
}

//https://program-life.com/669
///実行速度の計測
func exectionTime(action: () -> Void) {
    let startDate = Date()
    action()
    let endDate = Date()
    print(endDate.timeIntervalSince(startDate))
}

//https://riptutorial.com/ja/swift/example/14738/インデックスを知らずに配列から要素を削除する
extension Array where Element: Equatable {
    
    mutating func remove(_ element: Element) {
        _ = firstIndex(of: element).flatMap {
            self.remove(at: $0)
        }
    }
}

func binarySearch(rifgt:Int, key:Int, ary:[String]) -> Int{
    var left = 0
    var right = rifgt
    
    while abs(right - left) > 1 {
        let mid = left + (right - left) / 2
        
        if Int(ary[mid])! < key {
            left = mid
            
        } else {
            right = mid
        }
    }
    return left
}

func arrangement (prev:String, ary:[String], returnVal:[String]) -> [String] {
    var returnVal = returnVal
    if ary.count == 0 {
        returnVal.append(prev)
        return returnVal
    }
    
    for s in ary {
        let wprev = prev + s
        var wary = ary
        wary.remove(s)
        returnVal = arrangement(prev: wprev, ary: wary, returnVal: returnVal)
    }
    return returnVal
}
// https://algo-logic.info/divisor/
/// 約数の配列を返す
func divisor(_ n:Int) -> [Int] {
    var ret = [Int]()
    var i = 1
    while i * i <= n {
        if n % i == 0 {
            ret.append(i)
            if i * i != n {
                ret.append(n / i)
            }
        }
        i += 1
    }
    return ret.sorted()
}

func main() {
    print(readLine()!)
    let N = readInt()
    //＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿＿ここまで入力
    print(N % 9 == 0 ? "Yes": "No")
}
main()
//  [swift]
import Foundation

let n = readLine()!.trimmingCharacters(in: .whitespacesAndNewlines).split(separator: Character(""))

var acc = 0

for ch in n {
  acc = (acc + Int(ch)!) % 9
}

print(acc == 0 ? "Yes" : "No")
//  [typescript]
import * as fs from "fs";

const MOD: number = 1e9 + 7;

const input = fs.readFileSync("/dev/stdin", "utf8");

let s: string = input;
let sum: number = 0;
for (let i = 0; i < s.length; i++) {
    sum += +s[i];
}

let ans = sum % 9 ? "No" : "Yes";
console.log(ans);
//  [typescript]
import * as fs from "fs";

const input = fs
  .readFileSync("/dev/stdin", "utf8")
  .split("")
  .map(Number);

let sum = input.reduce((a,c) => {
	return a + c;
});

let ans = sum % 9 == 0 ? "Yes" : "No"; 

console.log(ans);
//  [typescript]
"use strict";

const main = (arg) => {
  const input = arg.trim();

  process.stdout.write(input % 9 === 0 ? "Yes" : "No");
};
main(require("fs").readFileSync("/dev/stdin", "utf8"));
//  [typescript]
// B - Multiple of 9
import { readFileSync } from 'fs';
const input = readFileSync('/dev/stdin', 'utf8');

const N = input
  .split('')
  .map((s) => parseInt(s))
  .reduce((a, b) => a + b);

console.log(N % 9 === 0 ? 'Yes' : 'No');
//  [typescript]
// B - Multiple of 9
import { readFileSync } from 'fs';
const input = readFileSync('/dev/stdin', 'utf8');

const N = parseInt(input);

console.log(N % 9 === 0 ? 'Yes' : 'No');
//  [python]
X = int(input())

if X == 3 or X == 5 or X == 7:  
    print("YES")
else:
    print("NO")
//  [python]
n=input()
print("YES" if n in "753" else "NO")
//  [python]
x = int(input())

if x == 3 or x == 5 or x == 7:
    print('YES')
else:
    print('NO')
//  [python]
X=int(input())
print("YES" if X==3 or 5 or 7 else "NO")
//  [python]
koman = int(input())
if koman==7 or koman==5 or koman==3:
    print("Yes")
else :
    print("No")
//  [python]
x=input()
if x=='7' and x=='5' and x=='3':
  print('YES')
else:
  print('NO')
//  [java]
import java.io.*;

class Main {
  public static void main(String[] args) throws IOException {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    String str = br.readLine();
    
    switch (str) {
      case "7" :
      case "5" :
      case "3" :
        System.out.println("YES");
        break;
      default :
        System.out.println("NO");
    }
  }
}
//  [java]
import java.util.Map.Entry;
import java.io.*;
import java.util.*;

public class Main {
	
	public static void main(String[] args) throws IOException {
		FastScanner sc = new FastScanner(System.in);
		
		int N = sc.nextInt();
		if(N == 3 || N == 5 || N == 7) System.out.println("YES");
		else System.out.println("NO");
	}
}

class FastScanner {
    private InputStream in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    public FastScanner(InputStream in) {
		this.in = in;
	}
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() {
    	if (hasNextByte()) return buffer[ptr++];
    	else return -1;
    }
    private static boolean isPrintableChar(int c){
    	return 33 <= c && c <= 126;
    }
    public boolean hasNext() {
    	while(hasNextByte() && !isPrintableChar(buffer[ptr]))
    		ptr++; return hasNextByte();
    }
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() {
    	return Double.parseDouble(next());
    }
}
//  [java]
import java.io.*;

class Main{
    public static void main(String[] args) throws IOException {
        BufferedReader a = new BufferedReader(new InputStreamReader(System.in));
        String input = a.readLine();
        int x = Integer.parseInt(input);
        if(x==3 || x==5 || x==7){
            System.out.println("YES");
        }else{
            System.out.println("NO");
        }
    }
}
//  [java]

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.StringTokenizer;

public class Main {


    public static void main(String[] args) throws IOException {
        Scanner s = new Scanner(System.in);
        int d = s.nextInt();
        if(d==7||d==5||d==3) System.out.println("Yes");
        else System.out.println("No");
                
                
    }




}


class Scanner
{
    StringTokenizer st;
    BufferedReader br;

    public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(s));}

    public String next() throws IOException
    {
        while (st == null || !st.hasMoreTokens())
            st = new StringTokenizer(br.readLine());
        return st.nextToken();
    }

    public int nextInt() throws IOException {return Integer.parseInt(next());}

    public long nextLong() throws IOException {return Long.parseLong(next());}

    public String nextLine() throws IOException {return br.readLine();}

    public double nextDouble() throws IOException
    {
        String x = next();
        StringBuilder sb = new StringBuilder("0");
        double res = 0, f = 1;
        boolean dec = false, neg = false;
        int start = 0;
        if(x.charAt(0) == '-')
        {
            neg = true;
            start++;
        }
        for(int i = start; i < x.length(); i++)
            if(x.charAt(i) == '.')
            {
                res = Long.parseLong(sb.toString());
                sb = new StringBuilder("0");
                dec = true;
            }
            else
            {
                sb.append(x.charAt(i));
                if(dec)
                    f *= 10;
            }
        res += Long.parseLong(sb.toString()) / f;
        return res * (neg?-1:1);
    }

    public boolean ready() throws IOException {return br.ready();}


}
//  [java]
import java.util.*;

public class Main {
	public static void main(String args[]) {
    	Scanner sc = new Scanner(System.in);
        int x = sc.nextInt()l
        if (x == 7 || x == 5 || x == 3) {
            System.out.println("YES");
        } else {
        	System.out.println("NO");
        }
    }
}
//  [java]
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        if(n == 7 || n == 5 || n == 3)System.out.println("Yes");
        else System.out.println("No");
    }
}
//  [cpp]
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include <numeric>
using namespace std;

int main()
{	long long int X;
	scanf("%lld", &X);
	if((X-3)*(X-5)*(X-7)==0){
	printf("YES");
	}
	else
	{
	printf("NO");
	}
	
}
//  [cpp]
#include <stdio.h>
#include <cstdio>
#include <queue>
#include <set>
using namespace std;

int main(){
  
  /* read input */
  int N;
  scanf("%d", &N); // read int
  
  /*solve problem*/
  if(N==7 || N==5 || N==3){
    printf("YES");
  }
  else
    printf("NO");
  
  return 0;
}
//  [cpp]
#include "stdio.h"

int main()
{
	int age;

	scanf("%d", &age);

	if ((age == 7) ||
		(age == 5) ||
		(age == 3))
	{
		printf("YES\n");
	}
	else
	{
		printf("NO\n");
	}

	return 0;
}
//  [cpp]
#include <bits/stdc++.h>
#include <cassert>
#define rep(i,N) for (int i = 0; i < (N); ++i)
#define rep2(i, a, b) for(ll i = a; i <= b; ++i)
#define rep3(i, a, b) for(ll i = a; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(c) begin(c), end(c)
#define ok() puts(ok?"Yes":"No");
template<class T> bool chmax(T &a, const T &b) { if(a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if(a > b) { a = b; return true; } return false; }
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using ii = pair<int, int>;
using vvi = vector<vi>;
using vii = vector<ii>;
using gt = greater<int>;
using minq = priority_queue<int, vector<int>, gt>;
using P = pair<ll,ll>;
const ll LINF = 1e18L + 1;
const int INF = 1e9 + 1;
//clang++ -std=c++11 -stdlib=libc++ 

int x; 
int main() {
  cin >> x; 
  if (x == 3 || x==5||x==7)` puts("YES");
  else puts("NO");
  return 0;
}
//  [cpp]
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
  ll a;
  cin>>a;
  if(a==3||a==5||a==7){
    cout<<"Yes"<<endl;
  }
  else{
    cout<<"No"<<endl;
  }
  return 0;
}
//  [cpp]
#include <bits/stdc++.h>
using namespace std;
#define int long long
// Big two primes
#define X 1001100011100001111ll
#define mod 1000000007
#define ll long long
#define all(a) a.begin(),a.end()
#define sortall(a) sort(all(a))
#define fo(i, n) for (int i = 0; i < n; i++)
#define fo1(i, n) for (int i = 1; i <= n; i++)
#define loop(i,a,b) for (int i = a; i < b; i++)
#define nloop(i,a,b) for (int i = a ; i>=b;i--)
#define tc(t) int t; cin >> t; while (t--)
#define arrip(a,n)  int a[n]; fo(i, n) cin >> a[i];
#define arrop(a,n)  fo(i,n) cout<<a[i]<<" ";
#define pb push_back
#define mp make_pair
#define itr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define PI 3.1415926535897932384626

#define fio ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define rr return 0
#define prec(n) fixed<<setprecision(n)
#define maxpq priority_queue<int>
#define minpq priority_queue<int, vector<int>, greater<int> >
#define inf (int)(1e18)
#define ini(a, i) memset(a, i, sizeof(a))
#define vi vector<int>
#define fi first
#define se second
#define endl "\n"
#define pi pair<int, int>
#define vpi vector<pi>
#define sz(s) s.size()
#define bits(n) __builtin_popcount(n)//Count set bits

const int MAXN = (int)((1e5) + 100);
int gcd(int a, int b) { if (a == 0) return b; return gcd(b % a, a);}
int max(int a, int b) {if (a > b) return a; else return b;}
int min(int a, int b) {if (a < b) return a; else return b;}


int32_t main()
{
#ifndef ONLINE_JUDGE
	freopen("chkkki.txt", "r", stdin);
	freopen("chkkko.txt", "w", stdout);
#endif
	fio;

	int n;
	cin >> n;

	if (n == 7 || n == 5 || n == 3)
		cout << "Yes" << endl;
	else
		cout << "No" << endl;
}
//  [c]
#include<stdio.h>
int main()
{
int a;
  scanf("%d",&a);
if(a==3 || a==5 ||a==7) printf("YES");
else printf("NO");

return 0;
}
//  [c]
#include <stdio.h>

int main()
{
	int a;

	scanf("%d\n",&a);

    if(a==3){ 
		printf("YES\n");
	}
	else if(a==5){
		printf("YES\n");
	}
	else if(a==7){
		printf("YES\n");
	}
    else {
		printf("NO\n");
    }

	return 0;
}
//  [c]
#include <stdio.h>

int main(void){
    int n;
    scanf("%d", &n);
	
  	if (n==3||n==5||n==7){
    printf("YES");
    }else{
      printf("NO");
    }
    return 0;
}
//  [c]
#include<stdio.h>
int main() {
  int a;
  scanf("%d", &a);
  if(a == 3 || a == 5 || a == 7) {
      printf("Yes");
  } else {
      printf("No");
  }
}
//  [c]
#include <stdio.h>
int main(void){
    int x;
    
    scanf("%d", &x);
    
    if(x == 3 || x == 5 || x == 7){
        printf("Yes\n");
    }else{
        printf("No\n");
    }
    
    return 0;
    
}
//  [c]
#include <stdio.h>
int main(void){
    int N;
    
    scanf("%d", &N);
    
    if(N == 3 || N == 5 || N == 7){
        printf("Yes\n");
    }else{
        printf("No\n");
    }
    
}
//  [javascript]

function main(input){
    input=input.split(' ');
    x=parseInt(input[0],10)
    if (x==3 ||x==5 || x==7){
        console.log("YES")
    }else{
        console.log("NO")
    }


}

main(require('fs').readFileSync('/dev/stdin', 'utf8'));
//  [javascript]
function main(input) {
  var x = input[0]-0;
  var ans = "NO";
  switch(x){
    case 7:
    case 5:
    case 3:
      ans = "YES";
  }
  console.log(ans);
}
main(require('fs').readFileSync('/dev/stdin', 'utf8').trim().split("\n"))
//  [javascript]
function main(input) {
  const X = parseInt(input, 10);
  if(X==3||X==5||X==7){
    console.log("YES");
  }else{
    console.log("NO");
  }
}
main(require('fs').readFileSync('/dev/stdin', 'utf8'));
//  [javascript]
function Main(input){
    const N = input.trim();
    let answer = 0;
    const array = ['3', '5', '7']
    const DFS = (N, num753) => {
        // 753の数値を含んでいるかチェック
        const contains357 = array.map(val => num753.includes(val)).reduce((a, b) => a && b);
        // 桁数上限に達成
        if(N.length == num753.length){
            if(contains357 && Number(num753) <= Number(N)) answer++;
            return; 
        }
        // 現在の数値をチェック
        if(contains357 && Number(num753) <= Number(N)) answer++;
        // 3,5,7を入れていく
        array.map(val => DFS(N, num753 + val));
    }
    // 一桁目を入れる
    array.map(val => DFS(N, val));
    console.log(answer);
}
Main(require("fs").readFileSync("/dev/stdin", "utf8"));
//  [javascript]
// inputに入力データ全体が入る
function Main(input) {
	// 1行目がinput[0], 2行目がinput[1], …に入る
	input = input.split("\n");
//	tmp = input[1].split(" ");
	//文字列から10進数に変換するときはparseIntを使います
	var a = parseInt(input[0], 10);

    if(a==7||a==5||a==3){console.log('Yes')}
    else{console.log('No')}

	
}
//*この行以降は編集しないでください（標準入出力から一度に読み込み、Mainを呼び出します）
Main(require("fs").readFileSync("/dev/stdin", "utf8"));
//  [javascript]
process.stdin.resume();
process.stdin.setEncoding('utf8');

var lines = []
var reader = require('readline').createInterface({
  input: process.stdin,
  output: process.stdout
});

reader.on('line', (line) => {
  lines.push(line);
});

reader.on('close', () => {
  var N = lines[0];
  var diff = [];
  for(var i=0; i<N.length-2; i++){
    var pick_num = N.slice(i, i+3);
    var sabun = Math.abs(753-pick_num);
    diff.push(sabun);
  }
  var result = Math.min(...diff).toString()
  console.log(result);
});
//  [go]
package main

import "fmt"

func main() {
	var x int
	fmt.Scan(&x)
	if x == 3 || x == 5 || x == 7 {
		fmt.Println("YES")
	} else {
		fmt.Println("NO")
	}
}
//  [go]
package main

import (
	"fmt"
)

func main() {
	var x int
	fmt.Scan(&x)

	if x%3 == 0 || x%5 == 0 || x%7 == 0 {
		fmt.Println("YES")
	} else {
		fmt.Println("NO")
	}

}
//  [go]
X = int(input())

if X in [7, 5, 3]:
    print('YES')
else:
    print('NO')
//  [ruby]
puts [3,5,7].include?(gets.to_i) ? 'YES' : 'NO'
//  [ruby]
def get_i() #空白区切の入力を数値(整数)の配列で返す
  return gets.chomp.split(" ").map(&:to_i)
end
def get_f() #空白区切の入力を数値(実数)の配列で返す
  return gets.chomp.split(" ").map(&:to_f)
end
def get() #空白区切の入力を文字列の配列で返す
  return gets.chomp.split(" ")
end
def get_nsp() #入力されたものを一文字ずつに区切った文字列の配列で返す
  return gets.chomp.split("")
end
def yn_judge(bool,y="Yes",n="No") #boolに真偽を投げることで、trueならy、falseならnの値を出力する
  return bool ? y : n 
end
def array(size,n=1,init=nil) #nに配列の次元数、sizeに配列の大きさ、initに初期値を投げることでその配列を返す
  if n==1
    return Array.new(size){init}
  else
    return Array.new(n).map{Array.new(size){init}}
  end
end

x=gets.to_i
if x==7 or x==5 or x==3
  puts "YES"
else
  puts "NO"
end
//  [ruby]
a = gets.to_i
if a < 8 && 2 < a && a%2 == 1
  puts 'YES'
else
  puts 'NO'
end
//  [ruby]
if [3,5,7].include?(gets.chomp)
  puts "YES"
else
  puts "NO"
end
//  [ruby]
s=gets.to_i
a=[3,5,7]
puts (a.include?(s))?  :Yes : :No
//  [rust]
use std::io::*;
use std::str::FromStr;

pub fn read<T: FromStr>() -> T {
    let stdin = stdin();
    let stdin = stdin.lock();
    let token: String = stdin
        .bytes()
        .map(|c| c.expect("failed to read char") as char)
        .skip_while(|c| c.is_whitespace())
        .take_while(|c| !c.is_whitespace())
        .collect();
    token.parse().ok().expect("failed to parse token")
}

fn main() {
    let x: usize = read();
    println!(
        "{}",
        match x {
            5 | 3 | 7 => "YES",
            _ => "NO",
        }
    )
}
//  [rust]
use std::io::*;
use std::str::FromStr;

//https://qiita.com/tubo28/items/e6076e9040da57368845
fn read<T: FromStr>() -> T {
    let stdin = stdin();
    let stdin = stdin.lock();
    let token: String = stdin
        .bytes()
        .map(|c| c.expect("failed to read char") as char)
        .skip_while(|c| c.is_whitespace())
        .take_while(|c| !c.is_whitespace())
        .collect();
    token.parse().ok().expect("failed to parse token")
}

fn main(){
    match read::<usize>() {
        7 | 5 | 3 => println!("YES"),
        _ => println!("NO"),
    }
}
//  [rust]
use std::io;

fn read_i32_exn() -> i32 {
	let mut n = String::new();
	io::stdin().read_line(&mut n).expect("Failed to input");
	(*n).trim().parse::<i32>().unwrap()

}

fn main() {
   	let x = read_i32_exn();
	println!("{}",match x { 3|5|7 => "YES", _x => "NO",});

}
//  [rust]
// use proconio::marker::Chars;
use proconio::{fastout, input};
// use std::cmp::{max, min};

#[fastout]
fn main() {
    input! {
        x: usize
    };

    if x == 5 || x == 7 {
        println!("YES")
    } else {
        println!("NO")
    }
}
//  [rust]
use proconio::input;


fn main() {
    
    let  a : [i128 ; 3 ] = [ 7 ,5 , 3 ];
    let mut _x : i128 ;
    input!{

   x: i128 , 
 
   }

   if a.contains(&x){
       println!("Yes");
   }else{
       println!("No");
   }
}
//  [rust]
use proconio::input;


fn main() {
    
    let  a : [i128 ; 3 ] = [ 7 ,5 , 3 ];
    let mut x : i128 ;
    input!{

   x: i128 , 
 
   }

   if a.contains(&x){
       println!("Yes");
   }else{
       println!("No");
   }
}
//  [swift]
import Foundation

#if swift(>=4.0)
extension String {
    func split(by separator: String) -> [String] {
        return self.components(separatedBy: separator)
    }
    func toArray() -> [String] {
        return self.map{String($0)}
    }
}
#else
extension String {
    func split(by separator: String) -> [String] {
        return self.componentsSeparatedByString(separator)
    }
    func count() -> Int {
        return self.characters.count
    }
    func toArray() -> [String] {
        return self.characters.map{String($0)}
    }
}
extension Array where Element: Comparable {
    func max() -> Element! {
        return self.maxElement()
    }
    func min() -> Element! {
        return self.minElement()
    }
    func sorted() -> Array {
        return self.sort()
    }
    func reversed() -> Array {
        return self.reverse()
    }
    mutating func sort() {
        self.sortInPlace()
    }
}
extension Array {
    init(repeating: Element, count: Int) {
        self.init(count: count, repeatedValue: repeating)
    }
}
func stride<T: Strideable>(from start: T, to end: T, by stride: T.Stride) -> StrideTo<T> {
    return start.stride(to: end, by: stride)
}
#endif
func readInt() -> Int? {
    return Int(readLine()!)
}
func readStringSplit(by separator: String) -> [String] {
    return readLine()!.split(by: separator)
}
func readIntSplit(by separator: String) -> [Int] {
    return readLine()!.split(by: separator).map{Int($0)!}
}

/*************** テストスペース ***************/



/*************** メインプログラム ***************/

let X = readInt()!
print(X == 3 || X == 5 || X == 7 ? "YES" : "NO")
//  [swift]
var tmp: String? = readLine()
var tmp2: String = tmp!
var n = Int(tmp2)!

if n == 3 || n == 5 || n == 7{
    print("YES")
}else{
    print("NO")
}
//  [swift]
let inputLine: String = readLine()!
let x: Int = Int(inputLine)!

if x == 3 || x == 5 || x == 7 {
    print("YES")
} else {
    print("NO")
}
//  [swift]
print("YNEOS"[~(input()in"357")%2::2]
//  [swift]
print("YNEOS"[~input()in"357"%2::2]
//  [swift]
import Foundation

#if swift(>=4.0)
extension String {
    func split(by separator: String) -> [String] {
        return self.components(separatedBy: separator)
    }
    func toArray() -> [String] {
        return self.map{String($0)}
    }
}
#else
extension String {
    func split(by separator: String) -> [String] {
        return self.componentsSeparatedByString(separator)
    }
    func count() -> Int {
        return self.characters.count
    }
    func toArray() -> [String] {
        return self.characters.map{String($0)}
    }
}
extension Array where Element: Comparable {
    func max() -> Element! {
        return self.maxElement()
    }
    func min() -> Element! {
        return self.minElement()
    }
    func sorted() -> Array {
        return self.sort()
    }
    func reversed() -> Array {
        return self.reverse()
    }
    mutating func sort() {
        self.sortInPlace()
    }
}
extension Array {
    init(repeating: Element, count: Int) {
        self.init(count: count, repeatedValue: repeating)
    }
}
func stride<T: Strideable>(from start: T, to end: T, by stride: T.Stride) -> StrideTo<T> {
    return start.stride(to: end, by: stride)
}
#endif
func readInt() -> Int? {
    return Int(readLine()!)
}
func readStringSplit(by separator: String) -> [String] {
    return readLine()!.split(by: separator)
}
func readIntSplit(by separator: String) -> [Int] {
    return readLine()!.split(by: separator).map{Int($0)!}
}

/*************** テストスペース ***************/



/*************** メインプログラム ***************/

let X = readInt()!
print(X == 3 || X == 5 || X == 7 ? "Yes" : "No")
//  [typescript]
import * as fs from 'fs';

namespace AtCoder.abc114 {
    export class Program {
        static main(inp: string): void {

            const x: number = parseInt(inp);
            if (x === 3 || x === 5 || x === 7) {
                console.log('YES');
            } else {
                console.log('NO');
            }
        }
    }
}

AtCoder.abc114.Program.main(fs.readFileSync('/dev/stdin', 'utf8').trim());
//  [typescript]
console.log(require('fs').readFileSync('/dev/stdin','utf8').match(/7|5|3/)?'YES':'NO')
//  [typescript]
var input: string = require('fs').readFileSync('/dev/stdin', 'utf8');
var parts = input.split(" ");
var X = parseInt(parts[0]);
if (X == 3 || X == 5 || X == 7) {
    console.log("YES");    
} else {
    console.log("NO");    
}
//  [typescript]
'use strict'
function Main(input) {
  const ar = input.split("\n").map(x => x.split(" "));
  const X = Number(ar[0]);

  const ans = [3, 5, 7].includes(X) ? "Yes" : "No";
  console.log(ans)
}
Main(require("fs").readFileSync("/dev/stdin", "utf8"));
//  [python]
a, op, b = map(str,input().split())
print(eval(a + op + b))
//  [python]
A, op, B = input().split()
if op == "+":
    print(int(A) + int(B))
else:
    print(int(A) - int(B))
//  [python]
if __name__ == "__main__":
    a,b,c = input().split()
    if (b == '+'):
        print (int(a) + int(c))
    else:
        print (int(a) - int(c))
//  [python]
A, op, B = input().split()
if op == '-':
  print(int(A) - int(B))
else:
  print(int(A) + (B))
//  [python]
A, op, B = input().split()
if op = '-':
  print(A - B)
else:
  print(A + B)
//  [python]
A, op, B = list(map(int,input().split()))
if op = '+':
  print(A + B)
else:
  print(A - B)
//  [java]
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
        String[] firstLine = input.readLine().split(" ");
        long A = Long.parseLong(firstLine[0]);
        String op = firstLine[1];
        long B = Long.parseLong(firstLine[2]);

        if (op.equals("+")) {
            System.out.println(A+B);
        } else {
            System.out.println(A-B);
        }
    }
}
//  [java]
import java.util.*;
import java.io.*;
import static java.lang.Math.*;

public class Main {
    public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		
		// 入力
		int a = sc.nextInt();
		String s = sc.next();
		int b = sc.nextInt();
		
		// 計算
		int result = a - b;
		if(s.equals("+")) result = a + b;
		
		
		// 出力
		System.out.println(result);
	}

	public static class Scanner {
		private BufferedReader br; private StringTokenizer tok;
		public Scanner(InputStream is) throws IOException { br = new BufferedReader(new InputStreamReader(is));}
		private void getLine() throws IOException { while(!hasNext()) tok = new StringTokenizer(br.readLine());}
		private boolean hasNext() { return tok != null && tok.hasMoreTokens();}
		public String next() throws IOException { getLine(); return tok.nextToken();}
		public int nextInt() throws IOException { return Integer.parseInt(next());}
		public long nextLong() throws IOException { return Long.parseLong(next());}
		public double nextDouble() throws IOException { return Double.parseDouble(next());}
	}
}
//  [java]
import java.io.BufferedReader;
import java.io.InputStreamReader;

public class Main {
    public static void main(String[] args)throws Exception {
        BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
        String [] formula = input.readLine().split("\\s+");
        int x = Integer.parseInt(formula[0]);
        int y = Integer.parseInt(formula[2]);
        System.out.println(formula[1].equals("+")?(x + y):(x - y));

    }
}
//  [java]
import java.util.*;
class Main{
	public static void main(String args[]){
    	Scanner s= new Scanner(System.in);
      	int a=s.nextInt();
      	String str=s.next().charAt(0);
      //System.out.println(str);
      	int b=s.nextInt();
      	
      if(str=='+'){
      	System.out.println(a+b);	
      }else{
      System.out.println(a-b);}
      
    }
}
//  [java]
import java.util.*;
class Main{
	public static void main(String args[]){
    	Scanner s= new Scanner(System.in);
      	String str=s.next();
      //System.out.println(str);
      	int a=0;
       	int b=0;
      	int j=1;
      	char sym='+';
      	for(int i=0;i<str.length();i++){
          	if(str.charAt(i)=='+' || str.charAt(i)=='-'){
            	 j=i;
              sym=str.charAt(i);
              break;
            }
        	a=a*10+str.charAt(i)-'0';
              
        }
         for(int i=j+1;i<str.length();i++){
          	
        	b=b*10+str.charAt(i)-'0';
        }
      if(sym=='+'){
      	System.out.println(a+b);	
      }else{
      System.out.println(a-b);}
      
    }
}
//  [java]
import java.util.*;
class Main{
	public static void main(String args[]){
    	Scanner s= new Scanner(System.in);
      	String str=s.next();
      System.out.println(str);
      	int a=0;
       	int b=0;
      	int j=1;
      	char sym='';
      	for(int i=0;i<str.length();i++){
          	if(str.charAt(i)=='+' || str.charAt(i)=='-'){
            	int j=i;
              sym=str.charAt(i);
              break;
            }
        	a=a*10+str.charAt(i)-'0';
              
        }
         for(int i=j+1;i<str.length();i++){
          	
        	b=b*10+str.charAt(i)-'0';
        }
      if(sym=='+'){
      	System.out.println(a+b);	
      }else{
      System.out.println(a-b);}
      
    }
}
//  [cpp]
#include<stdio.h>
int main(void)
{
	int a,c;
	char b;
	scanf("%d %c %d",&a,&b,&c);
	if(b=='+'){
		printf("%d\n",a+c);
	}
	else if(b=='-'){
		printf("%d\n",a-c);
	}
	return 0;
}
//  [cpp]
#include <cstdio>
int a,b,c,d,i,j,k;
char t;
int main(){
	scanf("%d %c %d",&a,&t,&b);
	if (t=='-'){
		printf("%d\n",a-b);
	}	
	if (t=='+'){
		printf("%d\n",a+b);
	}
}
//  [cpp]
#include <stdio.h>
int main()
{
	long long a,b;
	char c;
		scanf("%lld",&a);
		scanf(" %c ",&c);
		scanf("%lld",&b);
		if(c=='-')
		{
			printf("%lld\n",a-b);
		}
		else
		{
			printf("%lld\n",a+b);
		}
	return 0;
}
//  [cpp]
#include<bits/stdc++.h>
using namespace std;

long long int bigmod (int a, int b, int m)
{
    if (b == 0) return 1%m;
    long long int x = bigmod(a,b/2,m);
    x = (x*x)%m;
    if (b%2==1) x = (x*a)%m;
    return x;
}

int main ()
{
    int n,i,temp;
    long long int ans;
    cin >> n;
    temp =n;
    vector <int> a(n);
    fill(a.begin(), a.end(),0);
    while(temp--)
    {
        cin >> i;
        a[i]++;
    }

    if ( n %2){
        if (a[0]!= 1)
        ans = 0;
        else{
        for ( i = 2; i<n ; i+=2)
            {
                if (a[i]!= 2)
                {
                    ans = 0;
                    break;
                }
            }
            }
    }
    else{
        for ( i= 1 ;i<n ;i+=2)
        {
            if (a[i]!= 2)
            {
                ans = 0;
                break;
            }
        }

    }
    if (ans != 0){
        n=n/2;
       int m=1 ;
     for ( i = 0; i<9;i++)
        m=m*10;
     m = m+7;
        ans = bigmod (2,n,m);
    }
    cout << ans <<"\n";
     return 0;
    }
//  [cpp]
#include <bits/stdc++.h>
using namespace std;
 
int main() {
  string op;
  int A, B;
  cin >> op >> A >> B;
  
  if (op == "+"){
	cout << A + B << endl;
  }
  else if (op == "-"){
    cout << A - B << endl;
  }
}
//  [cpp]
#include <bits/stdc++.h>
using namespace std;

int main() {
  int a, b;
  string p;
  cin >> a, p, b;

  if (p == "+") {
    cout << a + b << endl;
  }
  
  else if (p == "-") {
    cout << a - b << endl;
  }
}
//  [c]
#include<stdio.h>

int main()
{
    int a, b;
    char ch;
    scanf("%d %c %d", &a, &ch, &b);
    if(ch == '+') {
        printf("%d\n", a + b);
    }
    else {
        printf("%d\n", a - b);
    }
    return 0;
}
//  [c]
#include<stdio.h>
int main()
{
	unsigned long long A,B;
	char s;
	scanf("%llu %c %llu",&A,&s,&B);
	long long c;
	if(s=='+')
	{
		c=A+B;
		printf("%lld\n",c);
	}
	if(s=='-')
	{
		c=A-B;
		printf("%lld\n",c);
	}
	return 0;
}