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;

typedef long long ll;
typedef pair<ll, ll> P;

#define pb push_back
#define rep(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, n) for(int i = a; i < (n); i++)
#define mod (ll)(1e9+7)
#define int ll

__attribute__((constructor))
void initial() {
  cin.tie(0);
  ios::sync_with_stdio(false);
}

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

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

int main(){
	long otoshodama_A,otoshodama_B;
	cin >> otoshodama_A >> otoshodama_B;
	cout << otoshodama_A / 2 + otoshodama_B / 2 << endl;
	return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <deque>
#include <numeric>
#include <cmath>
#include <map>
#include <set>
#define ull unsigned long long
#define ll long long
using namespace std;

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>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD=1000000007;
//入力系
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
//出力系
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
//デバッグ系
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }

int main(){
    INT(n,c);
    out((n+c)/2);
}

C++: #include<iostream>
#include<algorithm>
#include<queue>
#define lol(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
typedef long long ll;
using namespace std;

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

C++: using namespace std;
 
int main(){
  int a,b;
  cin>>a>>b;
cost<<(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<stdio.h>
int main(void)
{
	int A,B,X;
	scanf("%d %d %d",&A,&B,&X);
	X=(A+B)/2;
	printf("%d\n",X);
	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;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
#define FOR(i, a, n) for(int (i)=(a);(i)<(n);(i)++)
#define eFOR(i, a, n) for(int (i)=(a);(i)<=(n);(i)++)
#define rFOR(i, a, n) for(int (i)=(n)-1;(i)>=(a);(i)--)
#define erFOR(i, a, n) for(int (i)=(n);(i)>=(a);(i)--)
#define SORT(i) sort((i).begin(),(i).end())
#define rSORT(i, a) sort((i).begin(),(i).end(),(a))
#define all(i) (i).begin(),(i).end()
constexpr ll INF = 1000000000;
//constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;

//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;
}

inline void init() {
    cin.tie(nullptr);
    cout.tie(nullptr);
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
}

template<class T>
inline istream &operator>>(istream &input, vector<T> &v) {
    for (auto &elemnt : v)input >> elemnt;
    return input;
}

int main() {
    init();
    int a,b;
    cin >> a >> b;
    cout << (a+b)/2 << "\n";
    return 0;
}

C++: #include <iostream>

using namespace std;

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

C++: //============================================================================
// Name        : AOL.cpp
// Author      : Akari Fujii
// Version     :
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
#include <cctype>
#include <algorithm>
using namespace std;
typedef long long ll;

int main() {


	ll a,b;

	cin>>a>>b;


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





}

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

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(){

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

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(){
int a, b;

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

return 0;
}

C++: #include<bits/stdc++.h>

using namespace std;

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

	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;
    cin >> a;
    int b;
    cin >> b;
    cout << ( a + b ) / 2 <<endl;
    return 0;
    // Your code here!
    
}

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

C++: // 2017/09/21 Tazoe

#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 x,y;
 cin >> x >> y;
 cout << (x+y)/2  << endl;
}

C++: #include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;



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

C++: #include <iostream>
#include <string>
#include <vector>
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(){
    int a,b;
    cin >> a >> b;
    cout << (a+b)/2 << endl;
}

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