#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
using namespace std;

#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;

// int mm1[] = {0,31,59,90,120,151,181,212,242,273,303,334};
// int mm2[] = {0,31,60,91,121,152,182,213,243,274,304,335};
// ¼ïPNPPú©çÌú
ll days(int y, int m, int d) {
  y--;
  ll res = y*365;
  res += (y/4)-(y/100)+(y/400); // [N
  for (int i=1; i<m; i++) {
    res += 31;
    if (i==4||i==6||i==9||i==11) res--;
    if (i==2) {
      res-=3;
      if (y%400==0||(y%4==0&&y%100!=0)) res++;
    }
  }
  // if (
  //   ret += mm2[m-1];
  // else
  //   ret += mm1[m-1];
  return res+d-1;
}

int main() {
  int y1,m1,d1,y2,m2,d2;
  while(cin>>y1>>m1>>d1>>y2>>m2>>d2) {
    if (y1<0||y2<0||m1<0||m2<0||d1<0||d2<0) break;
    cout << days(y2,m2,d2)-days(y1,m1,d1) << endl;
  }
}