#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)) {
    // printf("%d %d\n", y1, y2);
    if (y1 == -1) break;
    int dist = 0;
    if (y1 != y2) {
      dist += days[m1] - d1 + 1;
      if (m1 != 12) {
        for (int i = m1+1; i <= 12; ++i) {
          dist += days[i];
          if (i == 2 && IsLeap(y1)) dist++;
        }
      }
      d1 = m1 = 1;
      y1++;
      for (; y1 < y2; ++y1) {
        dist += 365;
        if (IsLeap(y1)) dist++;
      }
    } else {
      if (m1 == m2) {
        cout << d2 - d1 << endl; continue;
      } else {
        dist += days[m1] - d1 + 1;
        m1++;
      }
    }
    // same year
    for (; m1 < m2; ++m1) {
      dist += days[m1];
    }
    dist += d2 - 1;
    printf("%d\n", dist);
  }
  return 0;
}