#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>

using namespace std;

typedef long long Int;
typedef vector<int> vint;
typedef pair<int,int> pint;
#define mp make_pair

template<class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cout << *i << " "; cout << endl; }
template<class T> void chmin(T &t, T f) { if (t > f) t = f; }
template<class T> void chmax(T &t, T f) { if (t < f) t = f; }
int in() { int x; scanf("%d", &x); return x; }

int month[]={31,28,31,30,31,30,31,31,30,31,30,31};

int main() {
	int y1,m1,d1,y2,m2,d2;
	while(cin>>y1>>m1>>d1>>y2>>m2>>d2,y1>=0&&m1>=0&&d1>=0&&y2>=0&&m2>=0&&d2>=0){
		int day1,day2;
		int i;
		day1=(y1-1)*365+(y1-1)/4-(y1-1)/100+(y1-1)/400+d1;
		for(i=0;i<m1-1;i++){
			day1+=month[i];
			if(i==1&&y1%4==0&&(y1%100!=0||y1%400==0))day1+=1;
		}
		day2=(y2-1)*365+(y2-1)/4-(y2-1)/100+(y2-1)/400+d2;
		for(i=0;i<m2-1;i++){
			day2+=month[i];
			if(i==1&&y2%4==0&&(y2%100!=0||y2%400==0))day2+=1;
		}
		cout<<day2-day1<<endl;
	}
	return 0;
}