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 ASC(vec) vec.begin(), vec.end()    // 昇順ソート 例：sort(ASC(vec));
#define DESC(vec) vec.rbegin(), vec.rend() // 降順ソート 例：sort(DESC(vec));
#define rep(i, n) for (int i = 0; i < (n); i++)
#define Rep(i, n) for (int i = 1; i < n; i++)
#define REP(i, vec) for (auto i = vec.begin(); i != vec.end(); ++i)

const int       mod = 1000000007;
const int       inf = (1 << 21);
const long long INF = 1LL << 60;

using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
using vd = vector<double>;
using vb = vector<bool>;
using vl = vector<ll>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvb = vector<vector<bool>>;
using vii = vector<pair<int, int>>;
using vll = vector<pair<ll, ll>>;

template<class T>
inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T>
inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T>
T GCD(T a, T b) { if (b == 0) return a; else return GCD(b, a % b); }
template<class T>
T LCM(T a, T b) { return a / GCD(a, b) * b; }

constexpr array<int, 9> dx = { 0, 1, 0, -1, -1, 1, 1, -1, 0 };
constexpr array<int, 9> dy = { 1, 0, -1, 0, 1, 1, -1, -1, 0 };

// ──────────────────────────────────────────────────────────────────

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

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

C++: #include <iostream>
#include <algorithm>
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 = 0, b = 0;

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

	return 0;
}

C++: #include "bits/stdc++.h"
using namespace std;
int main()
{
    int a, b;
    scanf("%d%d", &a, &b);
    printf("%d\n", (a + b) / 2);
}

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

#define FOR( i, m, n )   for( int i = m; i < n; i++ )
#define REP( i, n )      FOR( i, 0, n )
#define ALL( a )         (a).begin(), (a).end()

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

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

C++: #include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <stdlib.h>
#include <string.h>
#include <cmath>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <set>
const long long MOD = 1000000007;
using namespace std;
typedef long long ll;
map<ll, int> mp;
signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int a, b;
	cin >> a >> b;
	cout << (a + b) / 2 << endl;
	return 0;
}

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

#define int long long
#define pb push_back 
#define mp make_pair
#define fr first
#define sc second
#define Rep(i, n) for( int i = 0; i < (n); i++ )
#define Rrep(i, a, n) for( int i = (a); i < (n); i++ )
#define All(v) v.begin(), v.end()

typedef pair<int, int> Pii; 
typedef pair<int, Pii> Pip;
const int INF = 1107110711071107;

signed 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, c;
	cin >> a >> b;
	c = (a + b) / 2;
	cout << c << 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(void){
    int a, b;
    cin>>a>>b;
    cout<<(a+b)/2<<endl;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
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;
	int ans = (a+b)/2;
	cout << ans << endl;
	return 0;
}

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

C++: #include<bits/stdc++.h>
using namespace std;
 
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
 
typedef long long ll;
typedef pair<int, int> ii;

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<stdio.h>
int main(void){
	int a,b;
	int ans=0;
	int wa=0;

	scanf("%d",&a);
	scanf("%d",&b);

	wa=a+b;

	ans=(a+b)/2;

	printf("%d\n",ans);
	return 0;
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<climits>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<bitset>
#include<iomanip>
using namespace std;

#define rep(i,j,n) for(int i=(j);i<(n);i++)
#define rep2(i,j,n) for(int i=(j);i<=(n);i++)
#define all(i) i.begin(),i.end()

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef pair<int, int> pi;
typedef long long i64;

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

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

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

C++: 
#include <iostream>


using namespace std;

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

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()
{
  int a, b;
  cin >> a >> b;
  
  int c; 
  c =  (a + b) / 2;
  cout << c;

  return 0;
}

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

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