Problem:
 Score : 100 points    Problem Statement There is an N -car train.  You are given an integer i . Find the value of j such that the following statement is true: "the i -th car from the front of the train is the j -th car from the back."      Constraints  1 \leq N \leq 100  1 \leq i \leq N         Input Input is given from Standard Input in the following format:  N  i       Output Print the answer.        Sample Input 1 4 2      Sample Output 1 3  The second car from the front of a 4 -car train is the third car from the back.       Sample Input 2 1 1      Sample Output 2 1       Sample Input 3 15 11      Sample Output 3 5

Solution (Python):
a,b=map(int,input().split())
print(a+1-b)

Solution (Python):
n,i=map(int, input().split())     
print(n-i+1)

Solution (Python):
def main():
    n, i = list(map(int, input().split()))
    print(n-i+1)

if __name__ == '__main__':
    main()

Solution (Python):
n,i=list(map(int ,input().split()))
ans=(n-i)+1
print(ans)

Solution (Python):
n,i=map(int, input().split())

print(n-i+1)

Solution (Python):
N,i = map(int, input().split())

print(N-i+1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
n,i=map(int,input().split())

print(n-i+1)

Solution (Python):
a,b = map(int,input().split())
print(a-b+1)

Solution (Python):
n, i = map(int, input().split())

print(n - i + 1)

Solution (Python):
print(1 + eval(input().replace(" ", "-")))

Solution (Python):
n,i=map(int, input().split())
print(n-i+1)

Solution (Python):
a,b=map(int,input().split())
print(a-b+1)

Solution (Python):
k,i = map(int,input().split())

print(k-i+1)

Solution (Python):
a,b = map(int,input().split())

print(a- b + 1)

Solution (Python):
n, i = map(int, input().split())
print(n-i+1)

Solution (Python):
n,m = [int(x) for x in input().split()]
print(n-m+1)

Solution (Python):
def mapt(fn, *args):
    return list(map(fn, *args))


def Input():
    return mapt(int, input().split(" "))

  
def main():
    n, i = Input()
    print(n - i + 1)


main()

Solution (Python):
n, i = map(int, input().split())
print(n-i+1)

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    n, i = LI()
    print(n-i+1)

main()

Solution (Python):
n,i = map(int,input().split())
print(n-i+1)

Solution (Python):
N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
N, i = map(int, input().split())

print(N - i + 1)

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
n,i = map(int,input().split())
print(n-i+1)

Solution (Python):
a,b=map(int,input().split(" "))
print(a-b+1)

Solution (Python):
a,b=map(int, input().split())
print(a-b+1)

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
a, b = map(int, input().split())
print(a + 1 - b)

Solution (Python):
n,i=list(map(int,input().split()))
print(n+1-i)

Solution (Python):
n, i = map(int, input().split())
print(n + 1 - i)

Solution (Python):
def main():
    a,b=map(int,(input()).split())
    print((a-b)+1)
main()

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
print(eval(input().replace(' ','-'))+1)

Solution (Python):
A,B =map(int,input().split())

print(A-B+1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
n,i = map(int,input().split())
print(n-i+1)

Solution (Python):
train_len, target_vehicle = map(int, input().split())

target_from_backside = train_len - (target_vehicle - 1)
print(target_from_backside)

Solution (Python):
N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
N, i = map(int, input().split())
print(N + 1 - i)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    N, x = map(int, readline().split())

    print(N - x + 1)


if __name__ == '__main__':
    main()

Solution (Python):
N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
N, i = map(int, input().split())

print(N - i + 1)

Solution (Python):
n, i = map(int, input().split())
print(n - (i-1))

Solution (Python):
N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
N,i = map(int,input().split())
print(N-i+1)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):
a,b = map(int,input().split())
print(a-b+1)

Solution (Python):
N, i = map(int, input().split())
print(N + 1 - i)

Solution (Python):
n, i = map(int, input().split())
print(n+1-i)

Solution (Python):
import sys

mod =10**9+7

def input():
    return sys.stdin.readline().rstrip()


def main():
    N,i =map(int,input().split())
    print(N-i+1)






if __name__ == "__main__":
    main()

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
n,m=map(int,input().split())
print(n-m+1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
n, m=map(int,input().split())
print(n+1-m)

Solution (Python):
a,b=map(int,input().split())
print(a-b+1)

Solution (Python):
print(eval(input().replace(" ","-"))+1)

Solution (Python):
n, i = map(int, input().split())
print(n-i+1)

Solution (Python):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):
n,p = map(int,input().split())
print(n-p+1)

Solution (Python):
N,i=map(int,input().split())
print((N-i)+1)

Solution (Python):
a,b=input().split()
a=int(a)
b=int(b)
print(int(a-b+1))

Solution (Python):
n,m = map(int, input().split())
print(n+1-m)

Solution (Python):
n, i = map(int, input().split())

print(n-i+1)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
N,i = map(int,input().split())
print(N-i+1)

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
a, b = map(int, input().split())
print(a - b + 1)

Solution (Python):
n, i = list(map(int, input().split()))

print(n-i+1)

Solution (Python):
A,B = map(int,input().split())
print(A-B+1)

Solution (Python):
N, i = map(int, input().split())
print(N+1-i)

Solution (Python):
n,i = map(int, input().split())
print(n-list(range(1,n+1)).index(i))

Solution (Python):
a,b=map(int,input().split())
print(a-b+1)

Solution (Python):
n,k = map(int,input().split())
print(n-k+1)

Solution (Python):
n , i = map(int,input().split())
print(n-i+1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
a,b=map(int,input().split())
print(int(a-b+1))

Solution (Python):
N,I = map(int,input().split())
print(N-I+1)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
N,i = map(int, input ().split ())
print (N-i+1)

Solution (Python):
a, b = map(int, input().split())
print(a+1-b)

Solution (Python):
a,b = map(int, input().split())
print(a-b+1)

Solution (Python):
n ,i = map(int, input().split())
res = n - i + 1
print(res)

Solution (Python):
n,i=map(int,input().split())

print(n-i+1)

Solution (Python):
n,i= map(int,input().split())
print(n-i+1)

Solution (Python):
def solve():
    a, b = map(int, input().split())
    print(a - b + 1)

solve()

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    N, i = map(int, readline().split())

    print(N - i + 1)

    return


if __name__ == '__main__':
    main()

Solution (Python):
n,i = map(int,input().split())
print(n - i + 1)

Solution (Python):
a, b = map(int, input().split())
print(a-b+1)

Solution (Python):
N, i = list(map(int, input().split()))

print(N - i + 1)

Solution (Python):
a, b = map(int, input().split())
print(a-b+1)

Solution (Python):
N, i = map(int, input().split())

print(N - i + 1)

Solution (Python):
N, i = map(int, input().split())
print(N + 1 - i)

Solution (Python):
n, i = map(int, input().split())

print(n-i+1)

Solution (Python):









n,i = map(int, input().split())

print(n-i+1)

Solution (Python):
N, i = map(int, input().split())
print(N + 1 - i)

Solution (Python):
print(eval(input().replace(" ","-")+"+1"))

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
import sys


stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(stdin.readline().rstrip())
def nm(): return map(int, stdin.readline().split())
def nl(): return list(map(int, stdin.readline().split()))


def main():
    n, i = nm()
    print(n - i + 1)


if __name__ == '__main__':
    main()

Solution (Python):
N, i = map(int,input().split())

print(N + 1 - i)

Solution (Python):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):

def main():
    n, i = map(int, input().split())
    print(n - i + 1)


if __name__ == "__main__":
    main()

Solution (Python):
n,a =map(int,input().split())
print(n-a+1)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
n, i = map(int,input().split())

if n == 1:
    print(1)
else:
    print(n-i+1)

Solution (Python):
a,b=(int(i) for i in input().strip().split(" "))
print(a+1-b)

Solution (Python):
n,i=map(int,input().split());print(n+1-i)

Solution (Python):
n,i=map(int,input().split());print(n+1-i)

Solution (Python):
N, i = map(int, input().split())

print(N-i+1)

Solution (Python):
a, b = map(int, input().split())
print(a-b+1)

Solution (Python):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):
N, i = map(int, input().split())

print(N - i + 1)

Solution (Python):
n,i=map(int,input().split())
print(n+1-i)

Solution (Python):
a,b=map(int,input().split())
print(a-b+1)

Solution (Python):
a, b = map(int, input().split())
print(a-b+1)

Solution (Python):
a, b = list(map(int, input().split()))
my_result = a - b + 1
print(my_result)

Solution (Python):
n, i= map(int, input().split())
print(n - i + 1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
a,b=list(map(int,input().split()))
print(a-b+1)

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
n, m = map(int, input().split())

print(n - m + 1)

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):

import sys


N,i = map(int, input().split())
ans =N-i +1
print(ans)

Solution (Python):
tmp = input().split(" ")

print(int(tmp[0]) - int(tmp[1]) + 1)

Solution (Python):


n, i = list(map(int, input().split()))

print(n-i+1)

Solution (Python):
N,i = list(map(int,input().split()))
print(N-i+1)

Solution (Python):
N, i = map(int,input().rstrip().split())
print(N+1-i)

Solution (Python):
N,I = (int(T) for T in input().split())
print(N+1-I)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
n, i = map(int, input().split())
if n == 1:
    print(1)
else:
    print(n - i + 1)

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):






































def calculation(lines):
    N, i = list(map(int, lines[0].split()))
    
    return [N-i+1]



def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines



def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['4 2']
        lines_export = [3]
    if pattern == 2:
        lines_input = ['1 1']
        lines_export = [1]
    if pattern == 3:
        lines_input = ['15 11']
        lines_export = [5]
    return lines_input, lines_export



def get_mode():
    import sys
    args = sys.argv
    if len(args) == 1:
        mode = 0
    else:
        mode = int(args[1])
    return mode



def main():
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    
    
    
    
    
    
    
    



if __name__ == '__main__':
    main()

Solution (Python):
if __name__ == '__main__':
	n,m = map(int,input().split())
	
	print(n-m+1)

Solution (Python):
n, i = map(int, input().split())
print(n-i+1)

Solution (Python):
n,i = map(int,input().split())
print(n-i+1)

Solution (Python):
N, i = map(int,input().split())
print(N-i+1)

Solution (Python):
n, i = map(int,input().split())

print(n - i + 1)

Solution (Python):
N, i = map(int, input().split())

print(N-i+1)

Solution (Python):
n, i = map(int, input().split())

print(n - i + 1)

Solution (Python):
N,i = map(int,input().split())

print(N+1-i)

Solution (Python):
N,i=map(int,input().split())

print((N-i)+1)

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

n, i = map(int, readline().split())
print(n-i+1)

Solution (Python):
N,i = map(int, input().split())

print(N - i + 1)

Solution (Python):
n,i = map(int, input().split())
print(n-i+1)

Solution (Python):
n, i = map(int, input().split())
print(n + 1 - i)

Solution (Python):
n,i = map(int,input().split())
print(n-i+1)

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
a,b=map(int,input().split())
res = a-b+1
print(res)

Solution (Python):
n, i = map(int, input().split())
print(n-i+1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
def main():
    n,i=map(int,input().split())
    print(n-i+1)
    
if __name__ == "__main__":
    main()

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
N,i = map(int,input().split())

print(N-i+1)

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
N , i = map(int,input().split())
print(N - i + 1)

Solution (Python):
n, i = map(int, input().split())
print(n + 1 - i)

Solution (Python):
def main():
 n,k = map(int,input().split())
 print(n - k + 1)
main()

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
n,i = map(int,input().split())
print((n-i)+1)

Solution (Python):
s = input().split(" ")
a,b = int(s[0]), int(s[1])
print(a - b + 1)

Solution (Python):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):
n, i = map(int, input().split())
print(n-i+1)

Solution (Python):
N,i = map(int,input().split())
print(N+1-i)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
a,b = map(int,input().split())
print(a-b+1)

Solution (Python):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):
n,k = map(int, raw_input().split(' '))
print n - k + 1

Solution (Python):
n,i = map(int, input().split())
print(n - i + 1)

Solution (Python):
a, b = list(map(int, input().split()))

print(a-b+1)

Solution (Python):
n, i = map(int, input().split())
print(n + 1 - i)

Solution (Python):
N, i = map(int,input().split())

print(N - i + 1)

Solution (Python):
N,M=map(int,input().split())
print(N-M+1)

Solution (Python):
import sys
N,i = map(int,input().split())
if not ( 1 <= N <= 100 and 1 <= i <= N ):
    sys.exit()

print(N - i + 1)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
a,b = map(int,input().split())
print(a-b+1)

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    N, i = map(int, input().split())

    ans = N - i + 1

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
n, i = map(int, input().split())
print(n-i+1)

Solution (Python):
import sys
rm = lambda: map(int, sys.stdin.buffer.readline().split())

a, b = rm()
print(a-b+1)

Solution (Python):
import sys
rm = lambda: map(int, sys.stdin.buffer.readline().split())

a, b = rm()
print(a+1-b)

Solution (Python):
a,b=map(int,input().split())
print(a-b+1)

Solution (Python):
N, i = map(int,input().split())
print(N-i+1)

Solution (Python):

[N,i] = list(map(int,input().split()))

print(N-i+1)

Solution (Python):
n, i = map(int, input().split())
print(n-i+1)

Solution (Python):
a,b=map(int,input().split())
print(a-b+1)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
x,y=map(int,input().split())
print(x-y+1)

Solution (Python):
n,i = map(int,input().split())
print(n - i + 1)

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    N, i = LI()

    print(N-i+1)

if __name__ == '__main__':
    resolve()

Solution (Python):
def solve():
    N, i = map(int, input().split())
    print(N - i + 1)


if __name__ == '__main__':
    solve()

Solution (Python):
a,b = map(int,input().split())
print(a-b+1)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
N,i=map(int,input().split())

print((N-i)+1)

Solution (Python):
N, I = map(int, input().split())
print(N-I+1)

Solution (Python):
A,B = map(int,input().split())
print(A-B+1)

Solution (Python):
N, i = list(map(int, input().split()))

print(N - i +1)

Solution (Python):
A,B=list(map(int,input().split()))
print(A-B+1)

Solution (Python):
n,i=map(int, input().split());print(n-i+1)

Solution (Python):
n,i=map(int, input().split())
print(n-i+1)

Solution (Python):
n,i=map(int,input().split());print(n-(i-1))

Solution (Python):
a,b=map(int,input().split())
print(a-b+1)

Solution (Python):
n,i=map(int,input().split())
print(n+1-i)

Solution (Python):
print(eval(input().replace(*' -'))+1)

Solution (Python):
print(eval(input().replace(*' -'))+1)

Solution (Python):
n, i = map(int, input().split())
print(n-i+1)

Solution (Python):
N, i = map(int, input().split())

x = N - i + 1

print(x)

Solution (Python):
N,i = map(int,input().split())
print(N-i+1)

Solution (Python):
a,b = map(int, input().split())
print(a-b+1)

Solution (Python):


n, i = map(int, input().split())

print(n - i + 1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
n , i = map(int,input().split())

print(n - i + 1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
N,i=map(int,input().split())
lst=[]
for s in range(N+1):
    lst.append(s)
a=len(lst)-i
print(a)

Solution (Python):
n,i = map(int,input().split())
print(n-i+1)

Solution (Python):
n, i = [int(i) for i in input().split()]

print(n-i+1)

Solution (Python):
def ABC107_A():
    n,i=map(int,input().split())
    print(n-i+1)

ABC107_A()

Solution (Python):
a,b=map(int,input().split())
print(a-b+1)

Solution (Python):
n,i = map(int,input().split())
print(n-i+1)

Solution (Python):
def main():
    N, i = map(int, input().split())
    print(N - i + 1)
main()

Solution (Python):
n, i = map(int, input().split())

print(n+1-i)

Solution (Python):
N,i = map(int,input().split())
print(N-i+1)

Solution (Python):
N,i=map(int,input().split())
if N==1:
  print(1)
else:
  print(N-i+1)

Solution (Python):
N,I = map(int,input().split())
print(1+N-I)

Solution (Python):
n, i = map(int, input().split())
print(n-i+1)

Solution (Python):
n,m=map(int,input().split())
print(n-m+1)

Solution (Python):
n , i = map(int,input().split())
print(n-i+1)

Solution (Python):
def imp():return map(int,input().split())
def ip():return int(input())

n,i=imp()
print(n+1-i)

Solution (Python):
n,i=map(int,input().split())
print(n+1-i)

Solution (Python):
a,b = map(int,input().split())
print(a-b+1)

Solution (Python):

n,i=map(int,input().split())



print(n-i+1)

Solution (Python):
n, i = map(int, input().split())

print(n-i+1)

Solution (Python):
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): return [[ini]*i for _ in range(j)]





N, A = mi()
print(N-A+1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
a,b = map(int,input().split())
print(a-b+1)

Solution (Python):
print(eval(input().replace(" ", "-")) + 1)

Solution (Python):
n, i = map(int, input().split())
print(n-i+1)

Solution (Python):
n,m = map(int,input().split())
print(n + 1 - m)

Solution (Python):
N,i = (int(x) for x in input().split())
if N >= i:
  print(N + 1 - i)
else:
  pass

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
a,b=map(int,input().split())
print(a-b+1)

Solution (Python):
a, b = map(int, input().split())

print(a+1-b)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
print(eval(input().replace(' ','+1-')))

Solution (Python):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
n,i = map(int,input().split())
print(n - i + 1)

Solution (Python):
def main():
    N, i = map(int, input().split())
    print(N - i + 1)

if __name__ == '__main__':
    main()

Solution (Python):
N,i =map(int,input().split())

print((N+1)- i)

Solution (Python):
n,i=map(int,input().split());print(n-i+1)

Solution (Python):
n,i = map(int, input().split())

ans = n - i + 1
print(ans)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
N,i = map(int,input().split())
print(N-(i-1))

Solution (Python):
a, b = map(int, input().split())
print(a-b + 1)

Solution (Python):
N, i = map(int, input().split())

x = N - i + 1

print(x)

Solution (Python):
n,i=map(int,input().split())
print(n+1-i)

Solution (Python):
N,i = map(int,input().split())

print(N-i+1)

Solution (Python):
n, i = map(int, input().split())
print(n-i+1)

Solution (Python):
n,i = map(int, input().split())

print(n-i + 1)

Solution (Python):
N,i = map(int,input().split())
print(N-i+1)

Solution (Python):
def actual(n, i):
    return n - i + 1

n, i = map(int, input().split())
print(actual(n, i))

Solution (Python):
from sys import  stdin
A, B = [int(x) for x in stdin.readline().rstrip().split()]
print(A-B+1)

Solution (Python):
n,i = map(int,input().split())

if n == 0:
    print(1)
else:
    print(n-i+1)

Solution (Python):
n,i=map(int, input().split())
print(n-i+1)

Solution (Python):
n,i = map(int,input().split())
print (n-i+1)

Solution (Python):


N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()


def main():
    N, i = map(int, input().split())
    print(N - i + 1)



if __name__ == "__main__":
    main()

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
N,i=map(int,input().split())

print(N-i+1)

Solution (Python):
n,i = map(int,input().split())

print(n - i + 1)

Solution (Python):
n,i = map(int,input().split())

print(n-i+1)

Solution (Python):
n,i=map(int,input().split());print(n-i+1)

Solution (Python):
N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
a,b=map(int,input().split())
print(a-b+1)

Solution (Python):
n, i = map(int, input().split())
print(n-i+1)

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):
n,i = map(int, input().split())
print(n+1-i)

Solution (Python):
n, i= map(int, input().split())
print(n - i + 1)

Solution (Python):
def resolve():
    N, i = map(int, input().split())
    print(N-i+1)
resolve()

Solution (Python):
a,b = map(int,input().split())
if a == 1 and b == 1:
    print(1)
else:
    print(a-b+1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
N,i = map(int,input().split())

print(N-i+1)

Solution (Python):
N,i = map(int,input().split())

print(N-i+1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
a, b = map(int, input().split())
print(a-b+1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
N,i = map(int,input().split())
print(N+1-i)

Solution (Python):
N, i = map(int, input().split())
print(N-i+1)

Solution (Python):

n,i=map(int,input().split())

print(n-i+1)

Solution (Python):
n,m=map(int,input().split())
print(n-(m-1))

Solution (Python):
N,i = list(map(int,input().split()))
print(N-i+1)

Solution (Python):
a,b=map(int,input().split())
print(a-b+1)

Solution (Python):
N,i=map(int, input().split())
print (N-i+1)

Solution (Python):

N, i = map(int, input().split())


print(N - (i - 1))

Solution (Python):
def main():
    N, i = map(int, input().split())

    print(N - i + 1)

if __name__ == '__main__':
    main()

Solution (Python):
N,i=map(int,input().split())
print(N-i+1)

Solution (Python):
n, i = map(int, input().split())
print(n-i+1)

Solution (Python):
n, i = map(int, input().split())
ans = n - i + 1
print(ans)

Solution (Python):
def resolve():
	n, i = map(int, input().split())
	print(n - i + 1)
resolve()

Solution (Python):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
n,i = map(int,input().split())
print(n-i+1)

Solution (Python):
N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
n,i = map(int,input().split())
print(n-i+1)

Solution (Python):
n,i = map(int,input().split())
print(n-i+1)

Solution (Python):
N, i = map(int, input().split())
print(N+1-i)

Solution (Python):
x, y = map(int, input().split())
print(x - y + 1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
n, i = map(int, input().split())

ans = n - i + 1
print(ans)

Solution (Python):
a, b = map(int, input().split())
print(a-b+1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
n,i = map(int,input().split())
print(n-i+1)

Solution (Python):
n, i = map(int, input().split())
print(n-i+1)

Solution (Python):
N, i = map(int, input().split())
print(N -i + 1)

Solution (Python):
import sys
input = sys.stdin.buffer.readline


N, i = map(int, input().split())
print(N-i+1)

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
from fractions import gcd
import sys
def input(): return sys.stdin.readline().rstrip()
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = 10**18


n, i = Is()
print(n-i+1)

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    n,i=map(int, input().split())
    print(n-i+1)
resolve()

Solution (Python):
n,i = map(int, input().split())
print(n-i+1)

Solution (Python):
N, i =map(int, input().split())
print(N-i+1)

Solution (Python):
n, i = list(map(int, input().split()))
print(n - i + 1)

Solution (Python):
N, i = map(int, input().split())

ans = N - i + 1
print(ans)

Solution (Python):






def main():
    n, i = map(int, input().split())
    return n-i+1


print(main())

Solution (Python):
n, m = map(int, input().split())

print(n-m+1)

Solution (Python):
n,i = map(int,input().split())
print(n-i+1)

Solution (Python):
s = list(map(int, input().split()))
print(s[0] + 1 - s[1])

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):
inf = 10 ** 15
mod = 10 ** 9 + 7
n,i = map(int, input().split())
print(n-i+1)

Solution (Python):
n,i=map(int,input().split())
print(n-i+1)

Solution (Python):






import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr


def lcm(a, b):
    return a * b // gcd (a, b)





N,i = inputIL()

print(N-i+1)

Solution (Python):
n, i = map(int, input().split())
print(n - i + 1)

Solution (Python):
N, i = map(int, input().split() )

print( N - i + 1 )