#include <iostream>
using namespace std;
int h[] = { 0,31,28,31,30,31,30,31,31,30,31,30,31 };
int l[] = { 0,31,29,31,30,31,30,31,31,30,31,30,31 };
bool isLeap(int y)
{
  if(y % 400 == 0) return true;
  else if(y % 100 == 0) return false;
  else if(y % 4 == 0) return true;
  else return false;
}
int daysfrom(int y,int m,int d)
{
  int *p = isLeap(y) ? l : h;
  int s = p[m] - d + 1;
  int i;
  for(i=m+1; i<13; i++){
    s += p[i];
  }
  return s;
}
int daysto(int y,int m,int d)
{
  int *p = isLeap(y) ? l : h;
  int s = d - 1;
  int i;
  for(i=m-1; i>0; i--){
    s += p[i];
  }
  return s;
}
int main()
{
  int y1,m1,d1,y2,m2,d2;
  for(;;){
    cin >> y1 >> m1 >> d1 >> y2 >> m2 >> d2;
    if(y1<0 || m1<0 || d1<0 || y2<0 || m2<0 || d2<0) break;
    if(y1==y2){
      int s1 = daysto(y1,m1,d1);
      int s2 = daysto(y2,m2,d2);
      cout << s2 - s1 << endl;
    }else{
      int s = daysfrom(y1,m1,d1);
      int i;
      for(i=y1+1; i<y2; i++){
	s += daysfrom(i,1,1);
      }
      s += daysto(y2,m2,d2);
      cout << s << endl;
    }
  }
  return 0;
}