3
-1 1 -1
 4
45 -1 41 -1
 1
-1
 5
40 -1 44 46 48
 6
43 40 37 34 -1 -1
 7
-1 2 4 -1 4 1 5
 19
23 26 -1 -1 35 38 41 -1 -1 -1 53 -1 59 62 6 7 8 9 -1
 6
-1 2 6 -1 -1 6
 16
3 8 13 18 23 -1 -1 -1 43 48 53 45 -1 -1 -1 -1
 13
25 24 23 22 24 27 -1 33 -1 2 2 2 -1
 12
-1 17 -1 54 -1 64 -1 74 79 84 -1 94
 8
-1 12 14 16 18 20 -1 -1
 13
2 -1 3 1 3 1 -1 1 3 -1 -1 1 1
 5
-1 40 42 -1 46
 2
1000000000 -1
 14
-1 5 3 -1 -1 31 31 31 -1 31 -1 -1 4 7
 3
-1 1000000000 999999999
 7
32 33 34 -1 -1 37 38
 1
1000000000
 10
29 27 -1 23 42 -1 -1 45 -1 -1
 3
39 42 -1
 15
-1 28 -1 32 34 26 -1 26 -1 -1 26 26 26 -1 -1
 3
1000000000 999999999 1000000000
 17
-1 -1 -1 -1 64 68 72 -1 45 46 47 48 49 50 51 52 53
 3
-1 1 1000000000
 2
-1 1000000000
 3
999999999 -1 1000000000
 1
1
 2
1000000000 1000000000
 3
999999999 1000000000 -1
 7
11 8 5 -1 -1 -1 -1
 3
-1 1 2
 2
-1 21
 8
-1 -1 1 7 -1 9 5 2
 11
9 21 17 13 -1 -1 -1 -1 -1 -1 -1
 3
-1 1000000000 -1
 6
-1 6 1 -1 -1 -1
 1
65
 20
-1 32 37 -1 -1 -1 57 -1 -1 40 31 33 -1 -1 39 47 43 -1 35 32
 5
-1 1 7 -1 5
 18
21 19 -1 -1 -1 48 50 -1 54 -1 5 1 -1 -1 -1 37 36 35
 9
42 39 36 33 -1 -1 -1 34 39
 2
-1 -1

1
 1
 1
 1
 1
 3
 2
 2
 2
 3
 2
 1
 6
 1
 1
 3
 1
 1
 1
 2
 1
 2
 2
 2
 2
 1
 2
 1
 1
 1
 2
 2
 1
 3
 3
 1
 2
 1
 5
 2
 4
 2
 1

#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:64000000")
int n, m, i, j, k, l, r, u, v, w;
const int maxn = 18;
const int maxm = 110;
const int maxmask = (1 << maxn) - 1;
const int infi = 1e9 + 7 + 1e7;
const long long infl = 1e18;
const double eps = 1e-6;
const int mod = 1000;
const int alp = 26;
vector<pair<long long, long long> > ar;
int main() {
  cin >> n;
  long long d = 0, l = 0, a, b = -1;
  for (i = 0; i < n; ++i) {
    scanf("%I64d", &a);
    if (a == -1) {
      ++l;
    } else {
      if (l) {
        ar.push_back(make_pair(-1, l));
        l = 0;
      }
      ar.push_back(make_pair(a, 0));
    }
  }
  if (l) {
    ar.push_back(make_pair(-1, l));
    l = 0;
  }
  l = 1;
  pair<long long, long long> c = make_pair(0, 0);
  if (ar.size() <= 2) {
    cout << 1;
    return 0;
  }
  if (ar.size() == 3 && ar[0].first == -1 && ar[2].first == -1) {
    cout << 1;
    return 0;
  }
  if (ar[0].first == -1) {
    c.first = ar[0].second;
    a = ar[1].first;
    i = 2;
  } else {
    i = 1;
    a = ar[0].first;
  }
  int res = 0;
  for (i = i; i < ar.size(); ++i) {
    if (ar[i].first != -1) {
      if (l == 0) {
        a = ar[i].first;
        ++l;
        continue;
      }
      if (l == 1) {
        long long d;
        d = (ar[i].first - a) / (c.second + 1);
        if (d * (c.second + 1) != ar[i].first - a) {
          ++res;
          c.first = c.second = 0;
          a = ar[i].first;
          l = 1;
          continue;
        }
        if (d > 0 && c.first) {
          d *= c.first;
          d = a - d;
          if (d <= 0) {
            ++res;
            c.first = 0;
            l = 1;
            a = ar[i].first;
            c.first = c.second = 0;
            continue;
          }
          d = (ar[i].first - a) / (c.second + 1);
        }
        b = d;
        a = ar[i].first;
        c.second = 0;
        ++l;
      } else {
        long long d;
        d = b * (c.second + 1);
        if (a + d != ar[i].first) {
          ++res;
          c.second = c.first = 0;
          l = 1;
          a = ar[i].first;
          continue;
        }
        c.second = 0;
        a = ar[i].first;
        ++l;
      }
    } else {
      if (l == 1) {
        c.second += ar[i].second;
      } else {
        if (b >= 0) {
          c.second += ar[i].second;
        } else {
          long long d;
          d = b * (c.second + ar[i].second);
          d += a;
          if (d > 0) {
            c.second += ar[i].second;
          } else {
            c.second += ar[i].second;
            ++res;
            j = 0;
            while (d <= 0) {
              ++j;
              d -= b;
            }
            c.first = j;
            c.second = 0;
            l = 0;
          }
        }
      }
    }
  }
  if (c.first || l || c.second || res == 0) {
    ++res;
  }
  cout << res;
  return 0;
}
