Create a program that takes two dates as input and outputs the number of days between the two dates.

Date 1 (y1, m1, d1) is the same as or earlier than date 2 (y2, m2, d2). Date 1 is included in the number of days, not date 2. Also, take the leap year into account when calculating. The leap year conditions are as follows.

* The year is divisible by 4.
* However, a year divisible by 100 is not a leap year.
* However, a year divisible by 400 is a leap year.



Input

Given multiple datasets. The format of each dataset is as follows:


y1 m1 d1 y2 m2 d2


When any of y1, m1, d1, y2, m2, and d2 is a negative number, the input ends.

The number of datasets does not exceed 50.

Output

Output the number of days on one line for each dataset.

Example

Input

2006 9 2 2006 9 3
2006 9 2 2006 11 11
2004 1 1 2005 1 1
2000 1 1 2006 1 1
2000 1 1 2101 1 1
-1 -1 -1 -1 -1 -1


Output

1
70
366
2192
36890
#include <iostream>

using namespace std;

bool is_leap(int y) {
	if (y % 4 == 0) {
		if (y % 100 == 0) {
			if (y % 400 == 0) {
				return true;
			} else {
				return false;
			}
		} else {
			return true;
		}
	} else {
		return false;
	}
}

int w_month(int m, int y) {
	int montha[] = {4, 6, 9, 11};
	if (m == 2) {
		if (is_leap(y)) {
			return 3;
		} else {
			return 2;
		}
	} else {
		for (int i = 0; i < 4; i++) {
			if (m == montha[i]) {
				return 1;
			}
		}
		return 0;
	}
}

int main() {
	int y1, m1, d1, y2, m2, d2;
	const int year = 31 * 7 + 30 * 4 + 28;
	const int month[] = {31, 30, 28, 29};
	while (cin >> y1 >> m1 >> d1 >> y2 >> m2 >> d2) {
		if (y1 < 0 || m1 < 0 || d1 < 0 || y2 < 0 || m2 < 0 || d2 < 0 ) {
			break;
		}
		int count = 0;
		if (y1 == y2) {
			if (m1 != m2) {
				for (int i = m1+1; i < m2; i++) {
					count += month[w_month(i, y1)];
				}
				count += d2;
				count += month[w_month(m1, y1)]-d1;
			} else {
				count = d2-d1;
			}
		} else {
			if (y2 - y1 > 1) {
				count += year * (y2-y1-1);
				for (int i = y1+1; i <= y2-1; i++) {
					if (is_leap(i)) {
						count++;
					}
				}
			}
			for (int i = m1+1; i < 13; i++) {
				count += month[w_month(i, y1)];
			}
			for (int i = 1; i < m2; i++) {
				count += month[w_month(i, y2)];
			}
			count += d2;
			count += month[w_month(m1, y1)]-d1;
		}
		cout << count << endl;
	}
	return 0;
}