#include <iostream>
#include <algorithm>

using namespace std;

#define DEBUG

bool isContinues(int *nArray, int n) {
  if(nArray==NULL || n<1)
    return false;

  if(n==1)
    return true;

#ifdef DEBUG
  for(int i=0; i<n; i++)
    cout << nArray[i] << " ";
  cout << endl;
#endif

  sort(nArray, nArray+n);

#ifdef DEBUG
  for(int i=0; i<n; i++)
    cout << nArray[i] << " ";
  cout << endl;
#endif

  int nZero = 0;
  int nGap = 0;
  for(int i=0; i<n; i++) {
    if(nArray[i]==0)
      nZero++;
  }

  int smallerIndex = 0;
  int largerIndex = 1;
  while(largerIndex<n) {
    if(nArray[smallerIndex]!=0)
      nGap += nArray[largerIndex]-nArray[smallerIndex]-1;

    smallerIndex = largerIndex;
    largerIndex++;
  }

  if(nGap>nZero)
    return false;
  else
    return true;
}


int main(int argc, char **argv) {

  int array[] = {5,6,8,4,0};

  for(int i=0; i<5; i++)
    cout << array[i] << " ";
  cout << endl;

  if(isContinues(array, 5))
    cout << "Continue" << endl;
  else
    cout << "Not continue" << endl;

  return 0;
}