#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
#include <cmath>
#include <complex>
#include <map>
using namespace std;
 
#define rep(i,n) for(int i=0;i<int(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define EPS 1e-8
#define F first
#define S second
 
static const double PI=6*asin(0.5);
typedef pair<double,double> P;
typedef complex<double> CP;
typedef long long ll;
 
 
int main(){
    string s;
    char c;
    int t=0;
    int res=0;
    while(cin>>s){
    	rep(i,s.size()){
    		c=s[i];
        	if(c>='0'&&c<='9'){
           		if(t==0) t+=c-'0';
       			else{
               		t*=10;
               		t+=c-'0';
           		}
       		}
       		else{
           		res+=t;
       			t=0;
       		}
       		//cout<<t<<" "<<res<<endl;
    	}
    	res+=t;
    	t=0;
    }
    res+=t;
    cout<<res<<endl;
    return 0;
}