#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <limits>
#include <time.h>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
using namespace std;
// void fun()
// {
// // function calling itself is recursion
// fun();
// }
int sum(int n){
if (n == 0)
return 0;
return n + sum(n - 1);
}
int main()
{
int n = 4;
int m = sum(n);
cout << m;
return 0;
}
// int recurSum(int n)
// {
// if (n <= 1)
// return n;
// return n + recurSum(n - 1);
// }
// // Driver code
// int main()
// {
// int n = 5;
// cout << recurSum(n);
// return 0;
// }
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8c3RyaW5nPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8c3N0cmVhbT4KI2luY2x1ZGUgPHF1ZXVlPgojaW5jbHVkZSA8ZGVxdWU+CiNpbmNsdWRlIDxiaXRzZXQ+CiNpbmNsdWRlIDxpdGVyYXRvcj4KI2luY2x1ZGUgPGxpc3Q+CiNpbmNsdWRlIDxzdGFjaz4KI2luY2x1ZGUgPG1hcD4KI2luY2x1ZGUgPHNldD4KI2luY2x1ZGUgPGZ1bmN0aW9uYWw+CiNpbmNsdWRlIDxudW1lcmljPgojaW5jbHVkZSA8dXRpbGl0eT4KI2luY2x1ZGUgPGxpbWl0cz4KI2luY2x1ZGUgPHRpbWUuaD4KI2luY2x1ZGUgPG1hdGguaD4KI2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxzdHJpbmcuaD4KI2luY2x1ZGUgPHN0ZGxpYi5oPgojaW5jbHVkZSA8YXNzZXJ0Lmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgovLyB2b2lkIGZ1bigpCi8vIHsKLy8gCS8vIGZ1bmN0aW9uIGNhbGxpbmcgaXRzZWxmIGlzIHJlY3Vyc2lvbgovLyAJZnVuKCk7Ci8vIH0KCmludCBzdW0oaW50IG4pewoKCWlmIChuID09IDApCgkJcmV0dXJuIDA7CglyZXR1cm4gbiArIHN1bShuIC0gMSk7CgkKfQoKaW50IG1haW4oKQp7CglpbnQgbiA9IDQ7CglpbnQgbSA9IHN1bShuKTsKCWNvdXQgPDwgbTsKCXJldHVybiAwOwoKfQoKLy8gaW50IHJlY3VyU3VtKGludCBuKSAKLy8geyAKLy8gICAgIGlmIChuIDw9IDEpIAovLyAgICAgICAgIHJldHVybiBuOyAKLy8gICAgIHJldHVybiBuICsgcmVjdXJTdW0obiAtIDEpOyAKLy8gfSAKICAKLy8gLy8gRHJpdmVyIGNvZGUgCi8vIGludCBtYWluKCkgCi8vIHsgCi8vICAgICBpbnQgbiA9IDU7IAovLyAgICAgY291dCA8PCByZWN1clN1bShuKTsgCi8vICAgICByZXR1cm4gMDsgCi8vIH0g