#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#define debug(x) cerr << #x << " = " << x << endl;


#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 100010

/* ?\????1??´1???1??\?????????????????\??°?¨???? */
int Fairfield(int y,int m,int d){
  if(m<=2){
    y--;
    m+=12;
  }
  
  int dy = 365*(y - 1);
  int dl = y / 4 - y / 100 + y / 400;
  int dm = (306*m - 324) / 10;
  return dy + dl + dm + d - 1;
}

/* ?????\?¨???? (0??\?????\ - 6????????\)???*/
int Zeller(int y,int m,int d){
  if(m<=2){
    y--;
    m+=12;
  }
  return (y + y/4 - y/100 + y/400 + (13*m + 8)/5 + d)%7;
}

/* ???????????´ */
bool is_uruu(int y) {
  return y % 4 == 0 && (y % 100 != 0 || y % 400 == 0);
}



bool calc(){
  int ya,ma,da,yb,mb,db;

  cin >> ya >> ma >> da >> yb >> mb >> db;

  if(ya == -1) return false;


  cout << Fairfield(yb,mb,db) - Fairfield(ya,ma,da) << endl;

  return true;
}

int main(){

  while(calc());
  
  return 0;
}