#include <stdio.h>
 #include <stdlib.h>

long fib(long *fibs, int n) {
   if((n == 0) || (n == 1)) {
      fibs[n] = 1;
   } else {
       fibs[n] = fibs[n - 1] + fibs[n - 2];
   }
   return fibs[n];
}

int main(int argc, char *argv[]) {
   long *fibs;
   long sum = 0;
   int n = 6, i;
   fibs = malloc(n * sizeof(long));
   long tem;

   for(i = 0; i < n; i++) {
	   tem = fib(fibs, i);
       sum += tem;
   }

   printf("%ld\n", sum);
   free(fibs);
}