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
import java.util.*;

public class Main {
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		while(true){
			int[] a = new int[6];
			for(int i=0;i<6;i++) a[i] = sc.nextInt();
			if(a[0]==-1 && a[1]==-1 && a[2]==-1 && a[3]==-1 && a[4]==-1 && a[5]==-1) break;
			
			int[] sum = new int[2];
			
			for(int c=0;c<2;c++){
				for(int i=1;i<a[3*c];i++){
					if(i%400==0 || (i%4==0 && i%100!=0)) sum[c]+=366;
					else sum[c]+=365;
				}
				for(int i=1;i<a[1+3*c];i++){
					if(i==2){
						if(a[3*c]%400==0 || (a[3*c]%4==0 && a[3*c]%100!=0)) sum[c]+=29;
						else sum[c]+=28;
					}else if(i==4 || i==6 || i==9 || i==11){
						sum[c]+=30;
					}else{
						sum[c]+=31;
					}
				}
				sum[c]+=a[2+3*c];
			}
			System.out.println(sum[1]-sum[0]);
		}
	}	
}