#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <sstream>
#include <cmath>
#include <climits>
#include <set>
#include <iostream>
#include <map>
#include <functional>
#include <cstdlib>
#include <numeric>
#include <queue>
#include <complex>
#include <sstream>
#include <stack>

using namespace std;

#define reep(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reep(i,0,n)

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef complex<double> Point;

int days[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30};
int main()
{
	reep(i, 1, 12){
		days[i] += days[i-1];
	}
	
	for(;;){
		int e[2];
		rep(i, 2){
			int y, m, d;
			scanf("%d%d%d", &y, &m, &d);
			if(y<0)
				return 0;
			
			e[i] = days[m-1] + d - 1;
			if(y%4==0 && (y%100!=0 || y%400==0) && m>=3)
				++e[i];
			--y;
			e[i] += y*365 + y/4 - y/100 + y/400;
		}
		
		printf("%d\n", e[1] - e[0]);
	}
	
	return 0;
}