#include<iostream>
#include<cstdio>
#include<algorithm>
#include<climits>
#include<string>
#include<vector>
#include<list>
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<cstring>
#include<stack>
#include<functional>
using namespace std;

int main(){
	int dn[13] = {-1,31,28,31,30,31,30,31,31,30,31,30,31};
	int y1,m1,d1,y2,m2,d2;
	while(cin>>y1>>m1>>d1>>y2>>m2>>d2){
		if(y1<0 || m1<0 || d1<0 || y2<0 || m2<0 || d2<0) break;
		int ans = 0;
		for(int y=y1,m=m1,d=d1;;y++){
			if(y%4==0 && (y%100!=0 || y%400==0)) dn[2] = 29;
			else dn[2] = 28;
			for(;;){
				for(;;){
					if(y==y2 && m==m2 && d==d2) goto OUT;
					ans++;
					if(++d>dn[m]){
						d = 1; break;
					}
				}
				if(++m>12){
					m = 1; break;
				}
			}
		}
		OUT:
		printf("%d\n",ans);
	}
	return 0;
}