#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
using namespace std;

#define rep(i,n) for(int (i)=0; (i)<(int)(n); ++(i))
#define foreach(c,i) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)

const int days[13] = {
  0,
  31, 28, 31, 30, 31, 30,
  31, 31, 30, 31, 30, 31
};

inline bool IsLeap(const int year) {
  return (year % 400 == 0) || ((year % 4 == 0) && (year % 100 != 0));
}

int main() {
  int y1, m1, d1, y2, m2, d2;
  while (scanf("%d%d%d%d%d%d",&y1,&m1,&d1,&y2,&m2,&d2)) {
    if (y1 == -1) break;
    int lhs = d1, rhs = d2;
    for (int i = 1; i < y1; ++i) {
      lhs += 365;
      if (IsLeap(i)) ++lhs;
    }
    for (int i = 1; i < y2; ++i) {
      rhs += 365;
      if (IsLeap(i)) ++rhs;
    }
    for (int i = 1; i < m1; ++i)
      lhs += days[i];
    for (int i = 1; i < m2; ++i)
      rhs += days[i];
    if (m1 >= 3 && IsLeap(y1)) ++lhs;
    if (m2 >= 3 && IsLeap(y2)) ++rhs;
    // printf("%d : %d\n", lhs, rhs);
    printf("%d\n", rhs - lhs);
  }
  return 0;
}