#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>

#define rep(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define all(v) (v).begin(), (v).end()
#define rev(s) (s).rbegin(), (s).rend()
#define MP make_pair
#define X first
#define Y second

using namespace std;

typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;

int ytoi(int y){
	return (y*365+y/4-y/100+y/400);
}

int md[] = {0, 31, 28, 31, 30, 31, 30,
			31, 31, 30, 31, 30, 31};

int daycount(int y, int m, int d){
	int res = 0;
	res += ytoi(y-1);
	res += md[m-1];
	res += d;
	res += ((y%4 == 0 || y%100 || y%400) && m >= 3);

	return res;
}

int main(){
	for(int i = 1; i <= 12; i++) md[i] += md[i-1];

	int y1, m1, d1, y2, m2, d2;
	while(cin >> y1 >>m1 >> d1 >> y2 >> m2 >> d2, y1 >= 0){
		cout << daycount(y2, m2, d2) - daycount(y1, m1, d1) << endl;
	}

	return 0;
}