#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
#include <cmath>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i=0;i < (int)(n);i++)

int main(){
    string s;
    cin >> s;
    int n = s.size();
    if (n == 1) cout << "00"+s << endl;
    else if (n == 2) cout << "0"+s << endl;
    else cout << s << endl;    

    return 0;
}