output_description: Print the necessary number of candies in total.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      N
attempt: import sys, re
  from collections import deque, defaultdict, Counter
  from math import (
      ceil,
      sqrt,
      hypot,
      factorial,
      pi,
      sin,
      cos,
      tan,
      asin,
      acos,
      atan,
      radians,
      degrees,
      log2,
  )
  from itertools import (
      accumulate,
      permutations,
      combinations,
      combinations_with_replacement,
      product,
      groupby,
  )
  from operator import itemgetter, mul
  from copy import deepcopy
  from string import ascii_lowercase, ascii_uppercase, digits
  from bisect import bisect, bisect_left
  from fractions import gcd
  from heapq import heappush, heappop
  from functools import reduce
  
  
  def input():
      return sys.stdin.readline().strip()
  
  
  def INT():
      return int(input())
  
  
  def MAP():
      return map(int, input().split())
  
  
  def LIST():
      return list(map(int, input().split()))
  
  
  def ZIP(n):
      return zip(*(MAP() for _ in range(n)))
  
  
  sys.setrecursionlimit(10**9)
  INF = float("inf")
  mod = 10**9 + 7
  
  N = INT()
  print(N * (N + 1) // 2)
  
problem_description: Statement
  
  There are N children in AtCoder Kindergarten. Mr. Evi will arrange the
  children in a line, then give 1 candy to the first child in the line, 2
  candies to the second child, ..., N candies to the N-th child. How many
  candies will be necessary in total?
samples: [{"input": "3", "output": "6\n    \n\nThe answer is 1+2+3=6.\n\n* * *"}, {"input": "10", "output": "55\n    \n\nThe sum of the integers from 1 to 10 is 55.\n\n* * *"}, {"input": "1", "output": "1\n    \n\nOnly one child. The answer is 1 in this case."}]