Go: package main

import "fmt"

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

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

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

//define
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)),UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a+mod-b)%mod
#define MUL(a, b) a = (a * b) % mod
#define repi(i,m,n) for(int i = m;i < n;i++)
#define drep(i,n,m) for(int i = n;i >= m;i--)
#define rep(i,n) repi(i,0,n)
#define rrep(i,n) repi(i,1,n+1)
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(), v.rend()
#define dmp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define fi first
#define se second

//template
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
  os << p.first << " " << p.second;return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
  for (auto it = v.begin();it != v.end();++it){
    if (it != v.begin())os << " ";os << *it;
  }return os;
}
template<typename T, int SIZE>
int array_length(const T (&)[SIZE]){return SIZE;}
template<typename T, int N>
void print(const T (&a)[N], int s = N, int t = -1, bool f = true){
	if(t == -1){rep(i,s){if(i)cout << " ";cout << a[i];}}
	else repi(i,s,t){if(i!=s)cout << " ";cout << a[i];}
	if(f)cout << "\n";
}
template<typename T, int N1, int N2>
void print(const T (&a)[N1][N2], int h = N1, int w = N2){
	rep(i,h){rep(j,w){cout << a[i][j] << " \n"[j==w-1];}}
}

//typedef
typedef pair<int,int> P;
typedef pair<int, P> PP;
typedef pair<P, int> Pi;
typedef vector<int> vi;
typedef deque<int> dq;
const int inf = 1e9+7;
const int INF = 1e18+7;


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

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

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

C++: #include<stdio.h>
int main()
{
	int a,b;
	scanf("%d%d",&a,&b);
	printf("%d\n",(a+b)/2);
    return 0;
}

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

C++: #include <bits/stdc++.h>
#define rep0(i,n) for (int i = 0; i < (n); ++i)  //0index
#define rep1(i,n) for (int i = 1; i < (n); ++i)  //1index
#define REP(i,a,b) for (int i = a; i < (b); ++i)  //aからb - 1まで
#define mREP(i,a,b) for (int i = a; i > (b); --i)  //逆
#define all(x) (x).begin(),(x).end()
const int INF = 1000000007;  //最大値兼MOD
typedef long long ll;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
int main(){
  ll a,b;
  cin >> a >> b;
  cout << (a + b) / 2 << endl;
  return 0;
}

C++: #include<set>
using namespace std;
#include<iostream>
int	main(){
	int A,B;
	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 <bits/stdc++.h>
using namespace std;

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

    cout << (a + b) / 2 << endl;

    return (0);
}

C++: #include <bits/stdc++.h>
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(void){
    // Your code here!
    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;




}

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

int main(void){
    int a,b,heikin;
    cin>>a>>b;
    heikin=(a+b)/2;
    cout<<heikin<<endl;
}

C++: #include<cstdio>

int main(void){
    int akunnnootosidama, bkunnnootosidama;
    scanf("%d %d", &akunnnootosidama, &bkunnnootosidama);
    printf("%d\n", (akunnnootosidama+bkunnnootosidama)>>1);
    return(0);
}

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

C++: #include<bits/stdc++.h> 
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(void){
    int a,b;
    cin >> a >> b;
    cout << (a+b)/2 << endl;
}

C++: #include<stdio.h>
int main(void)
{
	int a,b;
	scanf("%d %d",&a,&b);
	printf("%d\n",(a+b)/2);
}

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

C++: #include <bits/stdc++.h>
#define pb push_back
#define REP(i, n) for (signed long long i = 0; i < (n); i++)
#define MOD 998244353
#define INF 93193111451418101
#define bitcnt(a) (ll) __builtin_popcount((a))
#define lb(a, b) lower_bound((a).begin(), (a).end(), (b))
#define ub(a, b) upper_bound((a).begin(), (a).end(), (b))
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;

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

C++: #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<queue>
#include<stack>
#include<bitset>
#include<functional>
#include<map>
#include<unordered_set>
using namespace std;
/*int p = 998244353;*/
int p = 1000000007;
#define int long long
#define vel vector<long long>
#define vvel vector<vel>
#define rep(i,n) for(int i=0;i<n;i++)
#define sor(v) sort(v.begin(),v.end())
#define mmax(a,b) a=max(a,b)
#define mmin(a,b) a=min(a,b)
#define mkp make_pair
#define pin pair<int,int>
#define qin pair<int,pin>
#define V vector
#define Endl endl
#define veb vector<bool>
#define rev(s) reverse(s.begin(),s.end())
#define end_pr(s) cout << s <<endl;return 0
signed main(){
	int a, b; cin >> a >> b;
	cout << (a + b) / 2 << endl;
}

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

int a,b;

int main(){
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;
}

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

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

C++: #include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>

using namespace std;

#define REP(i, n) for(ll i = 0;i < n;i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll long long
#define INF (ll)1 << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(),n.end()
#define MOD 1000000007
#define P pair<ll, ll>


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

C++: a

C++: #include <iostream>
using namespace std;
int main(void){
    
    
    //変数：Ａ君がもらった金額 「 a 」、Ｂ君がもらった金額 「 b 」と置く
    int a, b;
    
    //入力：Ａ君がもらった金額 「 a 」、Ｂ君がもらった金額 「 b 」を入力する
    cin >> a >> b;
    
    //出力：Ａ君とＢ君の平均値求める
    cout << (a + b)/2 << endl;
    
    
    return 0;
}

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

C++: #include<set>
using namespace std;
#include<iostream>
int	main(){
	int A,B;
	cin >> A >> B;
	cout << ( A + B ) / 2;
}

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