#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

using namespace std;

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

int main()
{
//	cut here before submit 
//	freopen ("testcase.SN", "r", stdin );

	string str = "";
	int sum = 0;
	while (cin >> str ){
		str += 'E';
		int n = str.length();
		int curr = 0;
		rep (i, n ){
			if (isdigit(str[i] ) ){
				curr *= 10;
				curr += (int)(str[i] - '0' );
			}else{
				sum += curr;
				curr = 0;
			} // end if
		} // end rep
	} // end loop

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