#include <stdio.h>

unsigned long int fibonacci(unsigned long int n);


int main()
{
    unsigned long int n, sum;
    printf("\nInput an integer: ");
    scanf("%u", &n);
    printf("n = %lu\n", n);
    printf("n = %d\n", n);
    return 1;
    sum = fibonacci(n);
    printf("Sum of first %lu Fibonacci numbers: %lu\n", n, sum);
    return 0;
}

/* This function computes the first n fibonacci numbers */
// It doesn't return anything

unsigned long int fibonacci(unsigned long int n)
{
    unsigned long int i;
    unsigned long int x0 = 0, x1 = 1, x2;
    unsigned long int s = x0 + x1;
    printf("X_0 = %lu\n", x0);
    printf("X_1 = %lu\n", x1);
    for (i = 2; i < n; i++) {
	x2 = x0 + x1;
	s += x2;
	x0 = x1;
	x1 = x2;
	printf("X_%lu = %lu\n", i, x2);
    }
    return s;
}