Go: package main

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

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanLines)
	total := 0
	sc.Scan()
	in := sc.Text()
	a := strings.Split(in, " ")
	for _, v := range a {
		n, _ := strconv.Atoi(v)
		total += n
	}

	fmt.Println(total)

}

C++: #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
　　　　　　　　　　　 ∧＿∧
　　　　　 ∧＿∧ 　（´<_｀ ）　 Welcome to My Coding Space!
　　　　 （ ´_ゝ`）　/　 ⌒i     @hamayanhamayan
　　　　／　　　＼　 　  |　|
　　　 /　　 /￣￣￣￣/　　|
　 ＿_(__ﾆつ/　    ＿/ .| .|＿＿＿＿
　 　　　＼/＿＿＿＿/　（u　⊃
---------------------------------------------------------------------------------------------------*/

int R, B, W, G;
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> R >> B >> W >> G;
    int ans = R + B + W + G;
    cout << ans << endl;
}

C++: #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
using namespace std;

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

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <functional>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;

template<class T, class Compare = greater<T> >
using MinHeap = priority_queue<T, vector<T>, Compare>;
template<class T, class Compare = less<T> >
using MaxHeap = priority_queue<T, vector<T>, Compare>;
using llong = long long;

int main() {
    llong r, b, w, g;

    cin >> r >> b >> w >> g;
    cout << r + b + w + g << endl;

    return 0;
}

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

C++: #include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}

//INSERT ABOVE HERE
signed main(){
  const int n=4;
  int ans=0;
  for(int i=0;i<n;i++){
    int x;
    cin>>x;
    ans+=x;
  }
  cout<<ans<<endl;
  return 0;
}

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

#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define endl '\n'
#define fi first
#define se second
using ll = long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
template<class T> using V = vector<T>;
const int dx[] = {0,1,0,-1,1,1,-1,-1};
const int dy[] = {1,0,-1,0,1,-1,-1,1};
const int inf = (1<<30)-1;
const ll infll = (1LL<<62)-1;
ll ceil(const ll &a, const ll &b){return ((a)+(b)-1)/b;}
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; }



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

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

int main() {
	long long R, B, W, G;
	cin >> R >> B >> W >> G;
	cout << R + B + W + G << endl;
}

C++: #include<iostream>
#include<stdio.h>
#include<string>
#include <algorithm>
#include<cstring>
#include <math.h>
#include <iomanip>
using namespace std;

int main()
{
  int r,b,w,g;
  cin>>r>>b>>w>>g;
  cout<<r+b+w+g<<endl;


  
  return 0;
}

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

#define ALL(a) (a).begin(), (a).end()

using namespace std;

signed main(){
	int a,b,c,d;
	cin >> a >> b >> c >>d;
	cout << a+b+c+d << endl;

	return 0;
}

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

int main(){
	int R, B, W, G;
	cin >> R >> B >> W >> G;
	cout << R + B + W + G << endl;
	return 0;
}

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

int main() {
  int R, B, W, G;
  cin >> R >> B >> W >> G;
  
  cout << R+B+W+G << endl;
  
  return 0;
}

C++: #include<algorithm>
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int a=0,sum=0;
int main(void){
	for(int i=0;i<4;i++){
		cin>>a;
		sum+=a;
	}
	cout<<sum<<endl;
	return 0;
}

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

int main(){
    int R,B,W,G;
    cin>>R>>B>>W>>G;
    cout<<R+B+W+G<<endl;
    return 0;

}

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

int main() {
	vector<int> RBWG(4);
	for (int& i : RBWG) cin >> i;
	cout << accumulate(RBWG.begin(), RBWG.end(), 0) << endl;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
using namespace std;
typedef long long int ll;

int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	int a,b,c,d; cin >> a >> b >> c >> d;
	cout << a+b+c+d << endl;
}

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

int main(){
	int l,a,z,i;
	cin >> l >> a >> z  >>i ;
	cout << (l+a+z+i) << endl;
	return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
    int R, B, W, G;
    cin >> R >> B >> W >> G;
    cout << R + B + W + G << endl;
}

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

int main(){
	int R,B,W,G ;
	cin >> R >> B >> W >> G ;
	cout << R + B + W + G << endl;
	return 0;
}

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

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

using namespace std;

int main(){
	ll r, b, w, g;
	
	cin>>r>>b>>w>>g;
	
	cout<<r+b+w+g<<endl;
}

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

int main (){

    int R,B,W,G;;

    cin >> R >> B >> W >> G;

    cout << R+B+W+G << endl;

    return 0;
    
}

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

#define	rep(i, n) for(int i=0; i<n; i++)

#define P pair<int, int>

typedef long long ll;

using namespace std;

#include <string>
#include <cctype>
typedef string::const_iterator State;
class ParseError {};


int main() {
	int r, b, w, g;
	cin >> r >> b >> w >> g;
	cout << r + w + b + g << endl;

	return 0;
}

C++: #include "bits/stdc++.h"

using namespace std;
using ll = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int r, b, w, g;
    cin >> r >> b >> w >> g;
    cout << r + b + w + g << '\n';
    return 0;
}

C++: // 2020/08/03 Tazoe

#include <iostream>
using namespace std;

int main()
{
	int R, B, W, G;
	cin >> R >> B >> W >> G;

	cout << R+B+W+G << endl;

	return 0;
}

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

using namespace std;

main(){
    int a,b,c,d;
    cin >>a >>b >>c >>d;
    printf("%d\n",a+b+c+d);
}

C++: #include <iostream>
using namespace std;
int main(){
    int R,B,W,G;
    cin >> R >> B >> W >> G;
    cout << R+B+W+G << endl;
    
    return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
    // Your code here!
    int R, B, W, G;
    cin >> R >> B >> W >> G;
    int ans = R + B + W + G;
    
    cout << ans << endl;
}