#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 1000000007

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;

string s;
int sum = 0;

int changei(string s){
	int res;
	stringstream ss;
	ss << s;
	ss >> res;
	return res;
}

int main(){
	while (cin >> s){
		string t;
		int co = 0, st = -1;
		REP(i, s.size()){
			if (st < 0 && s[i] >= '0'&&s[i] <= '9'){
				st = i;
				co++;
			}
			else if (st > 0){
				if (s[i] >= '0'&&s[i] <= '9'){
					co++;
				}
				else {
					t = s.substr(st, co);
					sum += changei(t);
					st = -1;
				}
			}
			if (i == s.size() - 1&&st>=0){
				t = s.substr(st, co);
				sum += changei(t);
				st = -1;
			}
		}
	}
	cout << sum << endl;
}