#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define ins insert
#define pq priority_queue
#define minele min_element
#define maxele max_element
#define lb lower_bound //first pos >= val
#define ub upper_bound // first pos > val
#define cnt_bit __builtin_popcount
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

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


int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

const ll oo = 1e18;
const ll maxN = 1e6;

/* Author : Le Ngoc Bao Anh, 10A5, LQD High School for Gifted Student */

void maximize(int &a, int b) {
    a = max(a, b);
}

void minimize(int &a, int b) {
    a = min(a, b);
}

int days[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

void solve() {
    string s; cin >> s;
    int y = 0, m = 0, d = 0, ans = 0;
    for(int i = 0; i < 4; i++) {
        y = y * 10 + (s[i] - '0');
    }

    for(int i = 5; i < 7; i++) {
        m = m * 10 + (s[i] - '0');
    }

    for(int i = 8; i < 10; i++) {
        d = d * 10 + (s[i] - '0');
    }

    while(y != 2021 || m != 7 || d != 23) {
        if(y % 100 == 0) {
            if(y % 400 == 0) days[1] = 29; else days[1] = 28;
        } else if(y % 4 == 0) days[1] = 29; else days[1] = 28;
        d++; ans++;
        if(d > days[m - 1]) {
            d = 1;
            m++;
            if(m > 12) y++, m = 1;
        }
    }

    cout << ans;
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #else
    //online
    freopen("olympics.inp", "r", stdin);
    freopen("olympics.out", "w", stdout);
    #endif

    int tc = 1, ddd = 0;
    // cin >> tc;
    while(tc--) {
        //ddd++;
        //cout << "Case #" << ddd << ": ";
        solve();
    }
}