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):
line = raw_input()
N, i = [int(s) for s in line.split(' ')]
print N - i + 1

Solution (Python):
import os, sys, re, math

lines = sys.stdin.readlines()

(N, i) = [int(i) for i in lines[0].split()]

print (N + 1 - i)

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):
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 = list(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):
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):
n, i= map(int, input().split())
print(n-i+1)

Solution (Python):
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
    
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 + 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):
s=list(input().split())
a=int(s[0])
b=int(s[1])
count=a-b+1
print(count)

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(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+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):
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):
N, i = map(int, input().split())
r = N+1-i
print(r)

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

Solution (Python):

n,i = list(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):
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):
print(eval(input().replace(" ","-"))+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):
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):
a, b = map(int, input().split(" "))
print(a - b + 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):
n,i=map(int,input().split());print(n-i+1)

Solution (Python):
source = input().split()
n, i = int(source[0]), int(source[1])
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):
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  

n, i = na()
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):
print(1+eval(input().replace(' ','-')))

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+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):
num = input().split()

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

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

Solution (Python):
N, i = [int(elem) for elem in 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,Y= [int(i) for i in input().split()]
print(N-Y+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):
import sys
stdin = sys.stdin

na = lambda: list(map(int, stdin.readline().split()))
n, i = na()

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 = list(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())
if 1 <= n <= 100 and 1 <= i <= n:
    print(n - i + 1)
else:
    print('hoge!')

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

print(N + 1 - i)

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):
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):
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):
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 main():
    N, i = map(int, input().split())
    return N-i+1

if __name__ == '__main__':
    print(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):
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):
import math
import sys
import queue
from collections import Counter
from itertools import accumulate
from fractions import gcd
from functools import reduce


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

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

sys.setrecursionlimit(10000)

mod = 1000000007

"""

a = 100
b = 0.987654321
print("{0:06d}-{1:6f}".format(a,b))
000100-0.987654


char_list = list("abcd") 



    = sys.stdin.readline().rstrip()
    = list(sys.stdin.readline().rstrip())


    = int(sys.stdin.readline())
    = map(int, sys.stdin.readline().split())
    = list(map(int, sys.stdin.readline().split()))
    = [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""

if __name__ == "__main__":
    N, i = map(int, sys.stdin.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 - 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):
N, i = list(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):
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 = [int(x) for x in 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):
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):
N, i = map(int, input().split(' '))

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

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

    print(N - i + 1)

main()

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

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


if __name__ == "__main__":
    print(solve())

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-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):
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):
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 test():
    n,i = map(int,input().split())
    print(n-i+1)


if __name__ == "__main__":
    test()

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

Solution (Python):
import math





inputa = input().split()





a = int(inputa[0])
b = int(inputa[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(int(N-i+1))

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):
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):
n, i = map(int, input().split())
print(n-i+1)

Solution (Python):
N,i = map(int,input().split())
print(max(1,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 = list(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=(int(x) for x in input().split())
print(n-i+1)

Solution (Python):

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

print(N-Xi+1)

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

Solution (Python):
import sys
input = sys.stdin.readline
from operator import itemgetter

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

if __name__ == '__main__':
	main()

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

Solution (Python):


N, i = map(int,input().rstrip().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 main():
    n,i = map(int, input().split())

    print(n-i+1)


if __name__ == '__main__' :
    main()

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-B+1)

Solution (Python):


def main():

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






    
if __name__== "__main__":
    main()

Solution (Python):
K = input().split()

N = int(K[0])
i = int(K[1])

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):
from functools import reduce
import math

def main():
    
    
    
    

    
    
    
    
    
    

    
    

    
    
    
    
    
    
    
    
    
    INF = float("inf")

    
    MOD = 10**9+7
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    N, i = (int(_) for _ in 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 = list(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):
from copy import deepcopy
from sys import exit,setrecursionlimit
import math
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac

setrecursionlimit(1000000)


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

def zip(a):
	mae = a[0]
	ziparray = [mae]
	for i in range(1,len(a)):
		if(mae != a[i]):
			ziparray.append(a[i])
			mae = a[i]
	return ziparray

def is_prime(n):
	if n < 2: return False

	for k in range(2, int(math.sqrt(n)) + 1):
		if n % k == 0:
			return False

	return True

def list_replace(n,f,t):
	return [t if i==f else i for i in n]

def base_10_to_n(X, n):
	X_dumy = X
	out = ''
	while X_dumy>0:
		out = str(X_dumy%n)+out
		X_dumy = int(X_dumy/n)
	if(out == ''): return '0'
	return out

def gcd(l):
	x = l.pop()
	y = l.pop()
	while(x%y!=0):
		z = x%y
		x = y
		y = z
	l.append(min(x,y))
	return gcd(l) if len(l) > 1 else l[0]

class Queue():
	def __init__(self):
		self.q = deque([])
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.popleft()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class Stack():
	def __init__(self):
		self.q = []
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.pop()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class graph():
	def __init__(self):
		self.graph = defaultdict(list)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
		self.graph[t].append(f)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
		self.graph[t].remove(f)
	def linked(self,f):
		return self.graph[f]

class dgraph():
	def __init__(self):
		self.graph = defaultdict(set)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
	def linked(self,f):
		return self.graph[f]

main()

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):
l = [int(i) for i in input().split()]
print(l[0]-l[1]+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):
inp = input()
num = inp.split(' ')
N = int(num[0])
i = int(num[1])
result = N - i + 1
print(result)

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

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

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

Solution (Python):
import numpy as np

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):
l = [int(i) for i in input().split(" ")]
print(l[0]-l[1]+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())
m=n-i+1
print(m)

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=list(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 - 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):
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):
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):
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):
i = list(map(int, input().split()))
print(int(i[0])-int(i[1])+1)

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

Solution (Python):
x,y = map(int,input().split())

print(x + 1 - y)

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,input().split())
res=n-k+1
print(res)

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

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007


def A():
    n, i = LI()
    print(n-i+1)
    return


def B():
    x1, y1, x2, y2 = LI()
    a = x2 - x1
    b = y2 - y1
    print(x2 - b, y2 + a, x1 - b, y1 + a)
    return


def C():
    n, k = LI()
    if k % 2:
        print((n // k)** 3)
    else:
        print(int((n//k)**3 + ((n-k/2)//k+1)**3))
        
    return


def D():
    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return


if __name__ == '__main__':
    A()

Solution (Python):

N,i = [int(i) for i in input().split()]
print(N - i + 1)

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

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

Solution (Python):
d = list(map(int, input().split()))
N = d[0]
i = d[1]
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):
def main():
    n,i = map(int,input().split())
    print(n-i+1)

main()

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())
if (1<=n<=100)and (1<=i<=n):
    j=n-i+1
print(j)

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):

l = list(map(int, input().split()))

print(l[0] - l[1] + 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):
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 =  list(map(int,(input().split())))

print(n-(i-1))

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

print(N - i + 1)

Solution (Python):
a = list(map(int,input().split()))
print(a[0]-a[1]+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=(int(i) for i in 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):
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):
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

N, i = nl()

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+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(N)
else:
    print(N - i + 1)

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

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

Solution (Python):
def main():
    
    N, i = parse()
    
    result = compute(N, i)
    
    print(result)

def compute(N, i):
    return N + 1 - i

def parse():
    vars = split_stdin(get_stdin())
    return int(vars[0]), int(vars[1])

def get_stdin():
    return input()

def split_stdin(stdin_val, delim = ' '):
    return [x for x in stdin_val.split(delim) if x != '']

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):
N, i = map(int, input().split())
print(N - i + 1)

Solution (Python):

import sys


def solve(N: int, i: int):
    print(N-i+1)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    i = int(next(tokens))  
    solve(N, i)

if __name__ == '__main__':
    main()

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())


answer = n-i+1


print(answer)

Solution (Python):
n,i = map(int,input().strip().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):
def abc():
    N, i = map(int, input().rstrip().split())
    print(N - i + 1)


abc()

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

print(n+1-p)

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):
import math
 
n,m = list(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+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+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):
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 = list(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):
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 = [int(ni) for ni 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())
print(n - i + 1)