#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int N = 1e6 + 10;
int t, n, m, k, l, r, op, x, y;
int f[N];
string s1, s2;
bool isleapyear(int x) {
    return (x % 4 == 0 && x % 100 != 0) || (x % 400 == 0);
}
int mons[13] = {-1, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int ye1, ye2, mo1, mo2, da1, da2;
int d;
void solve() {
    while (true) {
        d = 0;
        if (scanf("%4d%2d%2d", &ye1, &mo1, &da1) == EOF)break;
        if (scanf("%4d%2d%2d", &ye2, &mo2, &da2) == EOF)break;
        if(ye1*1000+mo1*100+da1>ye2*1000+mo2*100+da2){
            swap(ye1,ye2);
            swap(mo1,mo2);
            swap(da1,da2);
        }
        for (int i = 1; i < mo1; i++) {
            if (i == 2 && isleapyear(ye1))d -= 1;
            d -= mons[i];
        }
        d -= da1;
        for (int i = ye1; i < ye2; i++) {
            d += 365 + isleapyear(i);
        }
        for (int i = 1; i < mo2; i++) {
            if (i == 2 && isleapyear(ye2))d += 1;
            d += mons[i];
        }
        d += da2;
        d++;
        cout << d << "\n";
    }
}
int main() {
    solve();
    return 0;
}