Go: package main

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

func main() {
	var total int
	scanner := bufio.NewScanner(os.Stdin)
	for scanner.Scan() {
		line := scanner.Text()
		strs := strings.Split(line, " ")

		for _, s := range strs {
			x, _ := strconv.Atoi(s)
			total += x
		}
	}

	fmt.Printf("%v\n", total)
}

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 <cstdio>
using namespace std;
int main() {
    int t, sum =0;
    for (int i = 0; i < 4; i++) {
        scanf("%d", &t);
        sum+=t;
    }
    printf("%d\n", sum);
    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++: #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 <stdio.h>
int main(void) {
	int R, B, W, G;
	scanf("%d", &R);
	scanf("%d", &B);
	scanf("%d", &W);
	scanf("%d", &G);
	R = R + B + W + G;
	printf("%d\n", R);
	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 <vector>
#include <algorithm>
using namespace std;

int main(){
    int ans = 0;
    for(int i=0; i<4; i++){
        int a;
        cin >> a;
        ans += a;
    }
    cout << ans << endl;
    return 0;
}

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

int main() {

  int sum = 0;

  int a;
  for(int i = 0; i < 4; i++) {

    cin>>a;
    sum += a;
  }


  cout<<sum<<endl;

  return 0;

}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
    int R, B, W, G;
    cin >> R >> B >> W >> G;
    cout << R + B + W + G << "\n";
    return 0;
}

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

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

int main(){
    int s = 0;
    for(int i = 0; i < 4; i++){
        int x;  cin >> x;
        s += x;
    }
    cout << s << endl;
    return 0;
}

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

C++: #include<stdio.h>

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

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

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

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

    return 0;
}

C++: #include<stdio.h>

int main(void)
{
	int R,B,W,G,a;
	scanf("%d %d %d %d",&R,&B,&W,&G);
	a=R+B+W+G;
	printf("%d\n",a);
	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 << '\n';
    return 0;
}

C++: #include<iostream>
using namespace std;
int 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 a, b, c, d;
  cin >> a >> b >> c >> d;
  cout << a + b + c + d << endl;
}

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

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

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

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

C++: #include <iostream>

int main() {

	int a, b, c, d;
	std::cin >> a >> b >> c >> d;
	std::cout << a + b + c + d << std::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;
}

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

int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return (a*b)/gcd(a,b);}
char chlit(char c){return c+32;}
char chbig(char c){return c-32;}

int main(){
  int a,b,c,d;cin >> a >> b >> c >> d;
  cout << a+b+c+d << 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 <stdio.h>

int main(void)
{
	int R,B,W,G,wa;
	scanf("%d",&R);
	scanf("%d",&B);
	scanf("%d",&W);
	scanf("%d",&G);
	wa=R+B+W+G;
	printf("%d\n",wa);
	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<algorithm>
#include<bitset>
#include<cassert>
#include<cfloat>
#include<climits>
#include<cmath>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)

using namespace std;

typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;


template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
	return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template<typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type
fill_v(T& t, const V& v) { t = v; }
template<typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type
fill_v(T& t, const V& v) {
	for (auto& e : t) fill_v(e, v);
}


// aよりもbが大きいならばaをbで更新する
// (更新されたならばtrueを返す)
template <typename T>
bool chmax(T & a, const T & b) {
	if (a < b) {
		a = b;  // aをbで更新
		return true;
	}
	return false;
}
// aよりもbが小さいならばaをbで更新する
// (更新されたならばtrueを返す)
template <typename T>
bool chmin(T & a, const T & b) {
	if (a > b) {
		a = b;  // aをbで更新
		return true;
	}
	return false;
}


#define ARRAY_MAX 100005
const int INF = 1e9 + 7;
const ll MOD = 1e9 + 7;

int dx[4] = { 1,0,0,-1 };
int dy[4] = { 0,1,-1,0 };


/******************************************************************************************/



int main() {

	cin.tie(0);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(10);

	int r,b,w,g;
	cin >> r>>b>> w >> g;



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

	return 0;
}

C++: #include <iostream>

int main() {
  int tmp;
  int sum = 0;

  while (std::cin >> tmp) {
    sum += tmp;
  }

  std::cout << sum << std::endl;

  return 0;
}

C++: #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 99999999999999999
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;



int main(){

	int R,B,W,G;

	scanf("%d %d %d %d",&R,&B,&W,&G);

	printf("%d\n",R+B+W+G);

	return 0;
}