#include<iostream>
using namespace std;
typedef long long ll;

const int MNUM[] = {12,12};
const int ML[][12] = { {31,28,31,30,31,30,31,31,30,31,30,31},      //day/month in usual year
		      {31,29,31,30,31,30,31,31,30,31,30,31} };  //day/month in leap year
const string DAY[] = {"Sunday","Monday","Tuesday","Wednesday","Thursday","Friday","Saturday"};

struct date{
  int y,m,d;

  date(void):y(0),m(1),d(1){}
  date(int a,int b,int c):y(a),m(b),d(c){}

  int Leap(void){
    if(y%400==0)return 1;
    if(y%100==0)return 0;
    if(y%4==0)return 1;
    return 0;
  }

  date next(void){
    int l = Leap();
    if(ML[l][m-1]<++d){ d=1; m++; }
    if(MNUM[l]<m){ m=1; y++; }
    return *this;
  }

  ll dayCount(void)const{
    date tmp;
    for(ll res=0;;res++){
      if(tmp==*this)return res;
      tmp.next();
    }
  }

  //calculate days from Julian Day(-4713/01/01) using Fliegel's formula.
  ll Fliegel(void){
    int a = (14-m)/12, Y = y+4800-a, M = m+12*a-3;
    return (ll)d + (153*M+2)/5 + 365*Y + Y/4 - Y/100 + Y/400 - 32045;
  }

  //calculate day of week using Zeller congruence.
  int Zeller(void){
    int Y = y, M = m;
    if(M<3){Y--; M+=12;}
    return (Y + Y/4 - Y/100 + Y/400 + (13*M+8)/5 + d)%7;
  }

  bool operator==(const date x)const{return (y==x.y && m==x.m && d==x.d);}
  
  bool operator<(const date x)const{
    if(y!=x.y)return y<x.y;
    if(m!=x.m)return m<x.m;
    return d<x.d;
  }
  
  bool operator<=(const date x)const{return (*this<x || *this==x); }
  bool operator>(const date x)const{return !(*this<=x);}
  bool operator>=(const date x)const{return !(*this<x);}
  
  ll operator-(const date x)const{
    return dayCount() - x.dayCount();
  }
};

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