Go: package main

import "fmt"

func main() {
	var num1, num2 int
	fmt.Scan(&num1, &num2)

	fmt.Println((num1 + num2) / 2)
}

C++: #include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<(a+b)/2<<endl;
}

C++: #include <iostream>
using namespace std;
int main(void){
    // Your code here!
    int a,b;
    cin>>a>>b;
    a=a+b;
    cout<<a/2<<endl;
}

C++: #include <iostream>
using namespace std;
int main()
{
	int a, b;
	cin >> a;
	cin >> b;
	cout << (a+b)/2 << endl;
}

C++: #include <iostream>
using namespace std;
int main(void){
    
    int a,b;
    cin>>a>>b;
    cout<<(a+b)/2<<endl;
    
}

C++: #include <iostream>
using namespace std;
int main(){
    
    int b = 0;
    int a = 0;
    int c = 0;
    cin >> a;
    cin >> b;
    
    c = a + b;
    c = c /2;

    cout << c << endl;

    return 0;
}

C++: #include<algorithm>
#include<cassert>
#include<climits>
#include<cmath>
#include<cstring>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

using lint = long long;
using P = pair<int, int>;
using LLP = pair<long long, long long>;

#define REP(i, x, n) for(int i = (x), i##_len = int(n) ; i < i##_len ; ++i)
#define rep(i, n) for(int i = 0, i##_len = int(n) ; i < i##_len ; ++i)
#define reps(i, n) for(int i = 1, i##_len = int(n) ; i <= i##_len ; ++i)
#define rrep(i, n) for(int i = int(n) - 1 ; i >= 0 ; --i)
#define rreps(i, n) for(int i = int(n) ; i > 0 ; --i)
#define SORT(x) sort((x).begin(), (x).end())
#define SORT_INV(x) sort((x).rbegin(), (x).rend())
#define TWINS(x) cout << ((x) ? "Yay!" : ":(") << endl

constexpr int IINF = (1 << 30) - 1;
constexpr long long LLINF = 1LL << 61;
constexpr double EPS = 1e-8;

const int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};
const int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};

template<typename T>
bool chmax(T &a, T b){
    if(a < b){
        a = b;
        return true;
    }
    return false;
}

template<typename T>
bool chmin(T &a, T b){
    if(b < a){
        a = b;
        return true;
    }
    return false;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    int a, b;
    cin >> a >> b;
    cout << (a + b) / 2 << endl;

    return 0;
}

C++: #include <bits/stdc++.h>
#include <assert.h>
using namespace std;
using i64 = long long;

int main()
{
  i64 a, b;
  cin >> a >> b;
  cout << (a + b) / 2 << endl;
  return 0;
}

C++: #include<cstdio>
using namespace std;

int main() {
	int a, b;
	scanf("%d %d", &a, &b);
	printf("%d\n", (a + b) / 2);
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int a,b,c;
main(){
  cin>>a>>b;
  cout<<(a+b)/2<<endl;
}

C++: #include <iostream>
using namespace std;

int main() {
	int a,b;
	cin>>a>>b;
	cout<<(a+b)/2<<endl;
	return 0;
}

C++: #include<iostream>
using namespace std;

int main(){
    int a, b;
    cin >> a >> b;
    cout << (a + b) / 2 << endl;
    return 0;
}