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



Sample input:
4


Sample output:
1

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

result = 0
for x in range(n // 2):
  rest = n - x
  if x != rest:
    result += 1
print(result)

Submission status: Wrong Answer

Solution code:
n = int(input()) // 2
if not n & 1:
  n -= 1
print(n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# from collections import Counter
# n = int(input())
# li = list(map(int, input().split()))
# a, b = map(int, input().split())

n = int(input())

print(n//2 if n&1 else n//2+1)

Submission status: Wrong Answer

Solution code:
n=int(input())
print((n+1)//2)

Submission status: Wrong Answer

Solution code:
a=int(input())
print((a-1)/2)

Submission status: Wrong Answer

Solution code:
s = int(input())
print(((s+1)/2)-1)

Submission status: Wrong Answer

Solution code:
a = (int)(input())
print(a//2)

Submission status: Wrong Answer

Solution code:
N=int(input())
print(N-1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

c = n//2
if(c%2 == 0):c-=1
print(c)

Submission status: Wrong Answer

Solution code:
n = int(input())
if n == 1 or n == 0 or n == 2:
  print(0)
elif n <= 4:
  print(1)
else:
  print(n // 2 - 1)

Submission status: Wrong Answer

Solution code:
n = int(input())
if n == 1 or n == 0 or n == 2:
  print(0)
elif n <= 4:
  print(1)
else:
  print(n // 2)

Submission status: Wrong Answer

Solution code:
n = int(input())
if n == 0:
  print(0)
if n <= 4:
  print(1)
else:
  print(n//2)

Submission status: Wrong Answer

Solution code:
import math
N=int(input())
ans=N/4
ans=int(ans*2)
print(ans)

Submission status: Wrong Answer

Solution code:
a=int(input())
if a%2==0:
    ans=(a/2)-1
else:
    ans=a//2
print(ans)

Submission status: Wrong Answer

Solution code:
print(round(int(input())/2)-1)

Submission status: Wrong Answer

Solution code:
n = int(input())
a,b = divmod(n,2)
if b == 0:
  a += 1
print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

print(n // 2)

Submission status: Wrong Answer

Solution code:
n=int(input())
print(n//2)

Submission status: Wrong Answer

Solution code:
a=int(input())
b = 0

if a/2 == int(a/2):
    a = int(a/2)
else:
    a = int(a/2)+1

for i in range(1,a):
    if i+1 != a-i:
        b+=1
print(b)

Submission status: Wrong Answer

Solution code:
print(int(input())//2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
for i in range(1,N):
    if i >= N - i:
        print(i-1)
        exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = int(input())

print(a//2-a%2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def f(N):
  if N%2==0:
    return N//2-1
  else:
    return N//2
  N=int(input())
  print(f(N))

Submission status: Wrong Answer

Solution code:
print(int(input())-1//2)

Submission status: Wrong Answer

Solution code:
N=int(input())

print(N//2)

Submission status: Wrong Answer

Solution code:
a=int(input())
 
x=(a-2)/2
if int(x) ==x:
    print(int(x))
else:
    print(int(x)+1)

Submission status: Wrong Answer

Solution code:
a=int(input())

x=(a-2)/2
if int(x) ==x:
    print(int(x)-1)
else:
    print(int(x)+1)

Submission status: Wrong Answer

Solution code:
a=int(input())

x=(a-2)/2
if int(x) ==x:
    print(int(x))
else:
    print(int(x)+1)

Submission status: Wrong Answer

Solution code:
a=int(input())

x=(a-2)/2
if int(x) ==x:
    print(x)
else:
    print(int(x)+1)

Submission status: Wrong Answer

Solution code:
a=int(input())
#b=int(input())
#c=int(input())
#d=int(input())
x=(a-2)/2
if int(x) ==x:
    print(int(x))
else:
    print(int(x)+1)

Submission status: Wrong Answer

Solution code:
a=100
#b=int(input())
#c=int(input())
#d=int(input())
x=(a-2)/2
if int(x) ==x:
    print(int(x))
else:
    print(int(x)+1)

Submission status: Wrong Answer

Solution code:
a=int(input())
#b=int(input())
#c=int(input())
#d=int(input())

print(int((a-2)/2))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
if N%2 ==1:
  print(int(N+1)/2)
else:
  print(int(N/2))

Submission status: Wrong Answer

Solution code:
n=int(input())
print(int(n/2))

Submission status: Wrong Answer

Solution code:
print(int(input())//2-.5)

Submission status: Wrong Answer

Solution code:
#Sum of Two Integers
N = int(input())
print((N-1)//2 - (N-1)%2)

Submission status: Wrong Answer

Solution code:
#Sum of Two Integers
N = int(input())
print((N-1)//2 + N%2)

Submission status: Wrong Answer

Solution code:
N = int(input())

print(N // 2 + 1)

Submission status: Wrong Answer

Solution code:
N = int(input())
count = 0
for i in range(N):
    if i != N - i and N - i > 0:
        count = count + 1
print(count)

Submission status: Wrong Answer

Solution code:
N = int(input())
count = 0
for i in range(N):
    if i != N - i:
        count = count + 1
print(count/2)

Submission status: Wrong Answer

Solution code:
N = int(input())
count = 0
for i in range(N):
    for j in range(N):
        if i + j == N:
            count = count + 1
print(count/2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
print(n-1)

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = 0
for i in range(n//2):
    if n-i != i:
        ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

if N % 2 == 1:
    ans = (N - 1) / 2

else:
    ans = N / 2 - 1

print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

if N % 2 == 1:
    ans = (N + 1) / 2 - 1

else:
    ans = N / 2 - 1

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
ans=0
if N%2==0:
    ans=N/2
else:
    ans=int(N/2)
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
'''
------------------------
author : iiou16
------------------------
'''


def main():
    N = int(input())

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random

import os
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    os.system('dd if=/dev/zero of=1G.dummy bs=1M count=100000000000')
    
    
if __name__ == "__main__":
	main()

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random

import os
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    os.system('ls')
    
    
if __name__ == "__main__":
	main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

cnt = 0
for i in range(1, n//2+1):
    cnt += 1

print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())
print((x+1)//2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
if __name__ == '__main__':
	n = int(input())
	if n % 2 == 0:
		print(n/2 - 1)
	else:
		print((n-1)/2)

Submission status: Wrong Answer

Solution code:
N = int(input())
ans = 0
for i in range(1,int(N/2)):
  ans += 1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
if n == 1 or n == 2:
  print(0)
else:
  print(n//2)

Submission status: Wrong Answer

Solution code:
n = int(input())
print(int(n//2))

Submission status: Wrong Answer

Solution code:
import math

N = int(input())
ans = N/2

if N == 1:
	print(1)
else:
	print(math.floor(ans))

Submission status: Wrong Answer

Solution code:
import math

N = int(input())
ans = N/2

print(math.floor(ans))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

print(n // 2)

Submission status: Wrong Answer

Solution code:
N = int(input())

print(N//2-1)

Submission status: Wrong Answer

Solution code:
N = int(input())
if N // 2 == 0 :
  print("{}".format(N//2-1))
else:
  print("{}".format(N//2))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
count = 0
seen = []
for i in range(1,n+1):
  if i!=(n-i):
    if i and n-i not in seen:
      seen.append(i)
      seen.append(n-i)
      count += 1
print(count)

Submission status: Wrong Answer

Solution code:
a = int(input())

if a%2==0:
  print((a/2)-1)
elif a%2==1:
  print((a-1)/2)

Submission status: Wrong Answer

Solution code:
a = int(input())

if a%2==0:
  print((a/2)-1)
elif a%2==1:
  print(((a-1)/2))

Submission status: Wrong Answer

Solution code:
a = int(input())

if a%2==0:
  print(a/2-1)
elif a%2==1:
  print((a-1)/2-1)

Submission status: Wrong Answer

Solution code:
a = int(input())

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

Submission status: Wrong Answer

Solution code:
a = int(input())
print(a/2-1)

Submission status: Wrong Answer

Solution code:
a = int(input())
print(a//2+0**(a%2))

Submission status: Wrong Answer

Solution code:
int(input())//2

Submission status: Wrong Answer

Solution code:
N = int(input())

if N <= 2:
    print(0)

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

Submission status: Wrong Answer

Solution code:
import os
import numpy as np

class getStdin(object):
    @classmethod
    def get_int(cls):
        return int(input())

    @classmethod
    def get_ss_int(cls):
        return list(map(int, input().split()))

    @classmethod
    def get_na_int(cls):
        return np.array(sorted(list(map(int, input().split()))))

    @classmethod
    def get_na_intr(cls):
        return np.array(sorted(list(map(int, input().split())))[::-1])

if __name__ == '__main__':
    n = getStdin.get_int()
    print(n//2)
    os.sys.exit(0)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
a = n/2
print(round(a)-1)

Submission status: Wrong Answer

Solution code:
n = int(input())
a = n/2
print(int(round(a)-1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
n = int(input())
if n % 2 !=0:
    print(math.ceil(n/2))
else:
    print(n/2-1)

Submission status: Wrong Answer

Solution code:
n=int(input())
for i in range(1,n):
  if n-i<=i:
    print(i-1)
    break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = int(input())

value = 0
if a%2 == 0:
    value = round(a/2-1)
else:
    value = round(a/2)-1
print(value)

Submission status: Wrong Answer

Solution code:
a = int(input())

value = 0
if a%2 == 0:
    value = a/2-1
else:
    value = round(a/2)-1
print(value)

Submission status: Wrong Answer

Solution code:
a = int(input())

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

Submission status: Wrong Answer

Solution code:
n = int(input())
if n%2 != 0:
	print(n/2)
else:
  print(n/4)

Submission status: Wrong Answer

Solution code:
N = int(input())

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

print(n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
a = []

for x in range(1, N):
    y = N-x
    if x == y:
        continue
    a.append([x, y])

print(len(a))

Submission status: Wrong Answer

Solution code:
def add(x,y):
  sum=x+y
  return print(sum)

Submission status: Wrong Answer

Solution code:
def add(x,y):
  sum=x+y
  return sum

Submission status: Wrong Answer

Solution code:
print('Yes')

Submission status: Wrong Answer

Solution code:
n = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=int(input())
c=N/2
print(int(c))

Submission status: Wrong Answer

Solution code:
N=int(input())
if N==1 or N==2:
  ans=0
elif N%2==0:
  ans=(N/2)-1
else:
  ans=N//2  
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())

if n%2:
  print((n-1)/2)
else:
  print(n/2 -1)

Submission status: Wrong Answer

Solution code:
import math
N1 = input()
N = int(N1)
i = 0
j = 1
r = 0
for j in range (N):
    i=N-j
    if i!=j : 
        r+=1
        
math.floor (r/2)

Submission status: Wrong Answer

Solution code:
N=int(input())
c=round(N/2)
print(c-1)

Submission status: Wrong Answer

Solution code:
n = int(input())

if n % 2:
  print((n-1) / 2)
else:
  print(n/2 + 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = input()
print(a)

Submission status: Wrong Answer

Solution code:
import math
n = int(input())
if n%2==0:
    print(round((n**2-3*n)/4))

else:
    print(round((n**2-3*n+2)/4))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
ans=0
N=int(input())
c=round(N/2)
for i in range(1,c):
    for j in range(c,i,-1):
        cnt=i+j
        if cnt==N:
            ans+=1
            break
print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())

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

Submission status: Wrong Answer

Solution code:
N = int(input())

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

Submission status: Wrong Answer

Solution code:
n = int(input())
count = 0
 
for i in range(1, n // 2):
  if n - i == i:
    continue
    
  else:
    count += 1
    
print(count)

Submission status: Wrong Answer

Solution code:
N = int(input())

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

Submission status: Wrong Answer

Solution code:
import math

a = int(input())

cnt = 0
for i in range(1,a-2):
	if i ==  a :
		break
	elif i < a:
		a -= 1
		cnt += 1

print (cnt)

Submission status: Wrong Answer

Solution code:
N = int(input())

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

Submission status: Wrong Answer

Solution code:
ans=0
N=int(input())
c=round(N/2)
for i in range(1,c):
    for j in range(1,c):
        cnt=i+j
        if cnt==N:
            ans+=1
print(ans)

Submission status: Wrong Answer

Solution code:
N = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

print(N / 2 + 1)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
N=int(input())

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

Submission status: Wrong Answer

Solution code:
N=int(input())
a=[]
for i in range(1,N+1):
    b=N-i
    a.append(b)
 
if N%2==0 :
    print(len(a)/2-1)

else :
    print(round((len(a)-1)/2))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

else:
    print(N / 2 - 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
if n<3:
    print(0)
elif n%2==0:
    print((n/2)-1)
else:
    print(int(n//2))

Submission status: Wrong Answer

Solution code:
N = int(input())
l = []
for i in range(N):
    for j in range(i+1, N):
        if i == j and i + j != 4:
            continue
        if [j, i] not in l:
            l.append([i, j])
print(len(l))

Submission status: Wrong Answer

Solution code:
int = int(input())
print((int-int%2)/2)

Submission status: Wrong Answer

Solution code:
#import numpy as np
#from numpy import*
#from scipy.sparse.csgraph import shortest_path #shortest_path(csgraph=graph) # dijkstra# floyd_warshall
#from scipy.sparse import csr_matrix
 
from collections import* #defaultdict Counter deque appendleft
from fractions import gcd
from functools import* #reduce
from itertools import* #permutations("AB",repeat=2) combinations("AB",2) product("AB",2) groupby accumulate
from operator import mul,itemgetter
from bisect import* #bisect_left bisect_right
from heapq import* #heapify heappop heappushpop
from math import factorial,pi
from copy import deepcopy
import sys
sys.setrecursionlimit(10**8)
#input=sys.stdin.readline

def main():
    n=int(input())
    ans=0
    for i in range(n//2):
        ans+=(i!=n-i)
    print(ans)
    
    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

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

Submission status: Wrong Answer

Solution code:
from math import ceil,floor
N = int(input())
half = int(N / 2)
count = 0
for i in range(1, half):
  count = count + 1
if N % 2 != 0:
  print(count + 1)
else:
  print(count)

Submission status: Wrong Answer

Solution code:
N=int(input())

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

Submission status: Wrong Answer

Solution code:
print((int(input())+1)//2 + 1)

Submission status: Wrong Answer

Solution code:
target = int(input())
if(target%2==0):
  print(target/2-1)
  
else:
  	print((target+1)/2-1)

Submission status: Wrong Answer

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

else:
    print((N - 1) // 2)

Submission status: Wrong Answer

Solution code:
n=int(input())

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

Submission status: Wrong Answer

Solution code:
target = int(input())
if(target%2==0):
  print(target/2-1)
  
else:
  	print(target+1/2-1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

count = 0
for i in range(1,n//2):
    if not n - i == i:
        count +=1
        
print(count)

Submission status: Wrong Answer

Solution code:
int = int(input())
print(int*(int-1)/2+int)

Submission status: Wrong Answer

Solution code:
n = int(input())
print(n//2)

Submission status: Wrong Answer

Solution code:
num = int(input())
print((num-1) % 2)
exit(0)

Submission status: Wrong Answer

Solution code:
n = int(input())
cnt = 0
for i in range(n//2):
	if (i+1)**2 == n:
		continue
	cnt +=1
print (cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=int(input())

if N%2==1:
    print(N//2)

else:
    print(N/2-1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a = int(input())
if a%2 == 0:
    print(a/2-1)
else:
    print(int(math.floor(a/2)))

Submission status: Wrong Answer

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

print(a)

Submission status: Wrong Answer

Solution code:
a=int(input())
if a%2==1:
  print(a//2)
else:
  print(a/2-1)

Submission status: Wrong Answer

Solution code:
import math
n = int(input())
x = math.sqrt(n)
if n == 1:
    print(0)
elif x*x == n:
    print(math.floor(n/2)-1)
else:
    print(math.floor(n/2))

Submission status: Wrong Answer

Solution code:
N = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=int(input())
if a%2==1:
  print(a//2)
else:
  print(a/2+1)

Submission status: Wrong Answer

Solution code:
N = int(input())

count = 0

for i in range(1,int(N/2)+1):
    if i + N-i == N:
        count+=1
print(count)

Submission status: Wrong Answer

Solution code:
import math
n = int(input())
x = math.sqrt(n)
if x*x == n:
    print(math.floor(n/2)-1)
else:
    print(math.floor(n/2))

Submission status: Wrong Answer

Solution code:
N = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
n = int(input())
x = math.sqrt(n)
if x*x == n:
    print(math.floor(n/2)-1)
else:
    print(math.floor(n/2)-1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=int(input())
if a%2==1:
  print(a//2)
else:
  print(a/2+a)

Submission status: Wrong Answer

Solution code:
n=int(input())

if n==1 or n==2:
  print(0)
elif n%2==0:
  print((n/2)-1)
else:
  print((n-1)/2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = 0
for i in range(1, n//2):
  ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
n = int(input())
if n % 2 == 1:
    print(n//2)
else:
    print(n//4)

Submission status: Wrong Answer

Solution code:
a = int(input())
if a%2 == 0:
    b = a/2 - 1
else: b = (a + 1)/2 - 1
print(b)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!

n = int(input())
ans = 0
for i in range(0,n//2):
    if(n-i != i):
        ans += 1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input()) 

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
ans = 0
for i in range(n//2):
  ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
print(round((int(input())-1)/2))

Submission status: Wrong Answer

Solution code:
def main():
    N = int(input())
    cnt = 0
    for i in range(1,(N//2)+1):
        if i % 2 == 0:
            if i == N // 2:
                continue
        cnt += 1

    print(cnt)



if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!

n = int(input())
ans = 0
for i in range(0,n//2+1):
    if(n-i != n):
        ans += 1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
from itertools import accumulate, dropwhile, takewhile, groupby
import bisect
import copy
import math

# 入力 =stdin.readline().rstrip()
# 分割 = stdin.readline().rstrip().split()

'''
条件に合うものを絞り込む
data = [1, 2, 3]
s = [x for x in data if x % 3 == 0]
'''

'''
文字配列を数値に
l_si = ['-10', '0', '100']

l_si_i = [int(s) for s in l_si]
'''

'''
a = [2, 4, 6, 8]
b = [3, 6, 9]

print(list(set(a) | set(b)))  # 和集合
print(list(set(a) & set(b)))  # 積集合
'''

'''
N = int(stdin.readline().rstrip())
A = [int(x) for x in stdin.readline().rstrip().split()]
count = 0
while len([x for x in A if x % 2 == 0]) == N:
    A = list(map(lambda y: y / 2, A))
    count += 1
print(count)
'''

'''
.append(要素)
.extend(要素)
.insert(場所,要素)
del 配列名[場所]
-1で末尾で末尾から一つ前
'''
'''
間に空白追加
' '.join(lis)
'''
'''
copy.copy(配列名)
'''
'''
sort()50
sorted(reverse=true)
'''
'''
2分探索
bisect.bisect_left(リスト, 要素)
'''

N = int(stdin.readline().rstrip())
N = (N-1) / 2
print(N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a = int(input())
if a%2 == 0:
    print(a/2-1)
else:
    print(math.floor(a/2))

Submission status: Wrong Answer

Solution code:
N = int(input())
count = 0
for i in range(1, N//2):
    if (N-i) >= 1:
        count+=1
print(count)

Submission status: Wrong Answer

Solution code:
N = int(input())

ans = 0

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

Submission status: Wrong Answer

Solution code:
N = int(input())

cnt = 0 if N % 2 == 0 else 1
for i in range(1, N // 2):
    cnt += 1

print(cnt)

Submission status: Wrong Answer

Solution code:
import sys; readline = sys.stdin.readline
from collections import deque

N = int(readline())
print((N - 1)/2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def solve():
    print(int(input()) // 2)


if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
n = int(input())

s = n//2

print(s)