#include #if __has_include() #include using namespace atcoder; // using mint = modint998244353; // using mint = modint1000000007; // using mint = modint; #endif using namespace std; using ll = long long; constexpr char nl = '\n'; constexpr long long INF64 = 9223372036854775807; constexpr double PI = 3.14159265358979; #define rep(i, a, n) for(long long i = (long long)(a); i < (long long)(n); ++i) #define rrep(i, n, a) for(long long i = (long long)(n) - 1; (long long)(a) <= i; --i) #define all(a) std::begin(a), std::end(a) #define rall(a) std::rbegin(a), std::rend(a) #define Sort(a) sort(std::begin(a), std::end(a)) #define rsort(a) sort(std::rbegin(a), std::rend(a)) #ifdef LOCAL #include #define debug(...) print_normal_for_debug(#__VA_ARGS__, __VA_ARGS__) #define debug_rank(...) print_format_for_debug(#__VA_ARGS__, __VA_ARGS__) #define debug_println(...) debug_println(__VA_ARGS__) #define debug_print(...) debug_print(__VA_ARGS__) #else #define debug(...) (static_cast(0)) #define debug_rank(...) (static_cast(0)) #define debug_println(...) (static_cast(0)) #define debug_print(...) (static_cast(0)) #endif template void print(const T &arg) { std::cout << arg; } template void print(const T &arg, const U&... args) { std::cout << arg; print(args...); } long long solve1() { long long N; cin >> N; debug(N); print(((N + 1) * N) / 2 , nl); return 0LL; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); std::cout << std::fixed << std::setprecision(15); { long long times = 1LL; for (long long _index = 1LL; _index <= times; ++_index) { debug_println("--------------------------------", _index, "---------------------------------", '\n'); solve1(); debug_println("------------------------------------------------------------------", '\n'); } } return 0; }