Problem:
 Score : 100 points    Problem Statement How many ways are there to choose two distinct positive integers totaling N , disregarding the order?      Constraints  1 \leq N \leq 10^6  N is an integer.         Input Input is given from Standard Input in the following format:  N       Output Print the answer.        Sample Input 1 4      Sample Output 1 1  There is only one way to choose two distinct integers totaling 4 : to choose 1 and 3 . (Choosing 3 and 1 is not considered different from this.)       Sample Input 2 999999      Sample Output 2 499999

Solution (Python):


from collections import deque, defaultdict
import itertools as ite
import sys
import math
import decimal

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

N = input()

if N % 2 == 0:
    print (N - 1) / 2
else:
    print N / 2

Solution (Python):
n=int(input())
if n%2==0:
    print(n//2-1)
else:
    print(n//2)

Solution (Python):
n=int(input())
print((n-1)//2)

Solution (Python):
n = int(input())
if n% 2 == 0:
  print(n//2-1)
else:
  print(n//2)

Solution (Python):
N = int(input())
print(N//2 - 1 if N % 2 == 0 else N // 2)

Solution (Python):
n = int(input())
if n % 2 == 0:
    print(n // 2 - 1)
else:
    print(n // 2)

Solution (Python):
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
mod = 10**9+7
Max = sys.maxsize
def l(): 
    return list(map(int,input().split()))
def m(): 
    return map(int,input().split())
def onem(): 
    return int(input())
def s(x): 
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): 
    return " ".join(map(str,x))
def max2(x): 
    return max(map(max,x))
def In(x,a): 
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False
"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

n = onem()
co = 0
for i in range((n-1)//2):
    co += 1
print(co)

Solution (Python):
N=int(input())
if N%2==0:
    N-=1
print(N//2)

Solution (Python):
N=int(input())
print((N-1)//2)

Solution (Python):
N = int(input())
ans = (N-1)//2
print(ans)

Solution (Python):
n=int(input())
print((n-1)//2)

Solution (Python):
N = int(input())
print((N-1)//2)

Solution (Python):
n=int(input())

print((n-1)//2)

Solution (Python):
n=int(input())
if n%2==0:
    print(n//2-1)
else:
    print((n-1)//2)

Solution (Python):
N=int(input())
print((N-1)//2)

Solution (Python):

n = int(input())
ans = (n-1)//2
print(ans)

Solution (Python):
N = int(input())
print((N-1)//2)

Solution (Python):
n = int(input())
print((n-1)//2)

Solution (Python):
n = int(input())
print((n-1)//2)

Solution (Python):
n = int(input())
print((n-1)//2)

Solution (Python):
n=int(input())
if n%2==0:
  print(n//2-1)
else:
  print(n//2)

Solution (Python):
N = int(input())

print((N - 1) // 2)

Solution (Python):
N = int(input())
print((N-1)//2)

Solution (Python):



n = int(input())
print((n-1)//2)

Solution (Python):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7

def resolve():
    n=int(input())
    print((n-1)//2)
resolve()

Solution (Python):
n=int(input())
print((n-1)//2)