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

Solution (Python):
import sys
import math
import bisect

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

if __name__ == "__main__":
    main()

Solution (Python):

import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

N, i = lr()
answer = N + 1 - i
print(answer)

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

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

print( Ni[0] - Ni[1] + 1 )

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

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

if __name__ == '__main__':

    ABC_107_A()

Solution (Python):


import sys






















def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    n, i = mi()
    print(n + 1 - i)


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 = [int(x) for x 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+1-i)

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


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

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):
t, s = map(int, input().split())
print(t - s + 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-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(1) if N==i 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):
MOD = 10 ** 9 + 7
INF = 10 ** 11
import sys
sys.setrecursionlimit(100000000)

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

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

Solution (Python):
n, i = [int(x) for x in input().split()]
print([n - i + 1, 1][int(n == 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 = 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())
ans=n-i+1
print(ans)

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):
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+1-i)

Solution (Python):

import sys


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


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):
x = input().split()
n = int(x[0])
i = int(x[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-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())
eq= n-i+1
print(eq)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N, i = MAP()
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(i)for i in 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):
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, k = map(int, input().split())

print(n-k+1)

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










print(n-p+1)

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

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

print(n - i + 1)

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

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

ans = n - i + 1
print(ans)

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

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

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):
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):
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):
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):
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, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

N, i = nm()
print(1 if N == 1 else N - i + 1)

Solution (Python):

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

Solution (Python):
icase=0
if icase==0:
    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):
c, d = map(int,input().split())
print(c-d+1)

Solution (Python):
import math
import collections
import sys


def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]

n,i=MI()
ans=n+1-i
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):
s = input()
l=s.split(" ")
print(int(l[0])-int(l[1])+1)

Solution (Python):
a,b = list(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+1-b)

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())
    print(n-i+1)

if __name__ == '__main__':
    main()

Solution (Python):
import sys
IS = lambda: sys.stdin.readline().rstrip()
II = lambda: int(IS())
MII = lambda: list(map(int, IS().split()))

def main():
    n, i = MII()
    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 = tuple(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 = list(map(int,input().split()))
  
  
  
  
  ans = 0
  count = 0
  lis = []
  
  print(n-(i-1))

if __name__ == '__main__':
  main()

Solution (Python):



def solve():

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


if __name__ == "__main__":
    solve()

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

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

count = n - i + 1
print(count)

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,A=list(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())
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):
print(eval(input().replace(" ", "-")) + 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 = [int(x) for x in 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):
import sys
import os

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

MOD = 10 ** 9 + 7


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N, i = il()
    print(N-i+1)


if __name__ == '__main__':
    main()

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

print(n-i+1)

Solution (Python):
def Train(n , i):

    return n - i + 1 if n != 1 else 1

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

print(N-i+1)

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

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

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

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

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

Solution (Python):


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

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

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

print(n-i+1)

Solution (Python):
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect




from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
from datetime import datetime as dt

def main():
  n, i = map(int, readline().split())
  print(n-i+1)
  
  
  
if __name__ == '__main__':
  main()

Solution (Python):

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

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

Solution (Python):
import itertools
import fractions
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+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

n, i = map(int, sys.stdin.readline().split())

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

if __name__ ==  '__main__':
    main()

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

Solution (Python):
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

if __name__ == '__main__':
    a = [int(i) for i in input().split()]
    
    print(a[0]+1-a[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())

answer = N - i + 1

print(answer)

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):
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):
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(int(N)-int(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())
b = n - i + 1
print(b)

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


def main():
    ans = N - i + 1
    print(ans)


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

Solution (Python):
def main():
    n, i = map(int, input().split())
    train = list(range(1, n+1))[::-1]
    ans = train.index(i) + 1
    print(ans)


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):
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 if abs(n - i ) >= n//2 else 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):
a, b = map(int, input().split())
print(a+1-b)

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

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
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    A, B = list(map(int, sys.stdin.readline().split()))
    print(A-B+1)


if __name__ == '__main__':
    main()

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

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())
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(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):
x,y = map(int,input().split())

print(x-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):
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().rstrip().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 = [int(x) for x 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+1-i)

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

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

Solution (Python):
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni = lambda: int(ns())
nin = lambda x: [ni() for _ in range(x)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda x: [na() for _ in range(x)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda x: [ns() for _ in range(x)]
nas = lambda: 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 = map(int,input().split())
print(1+n-i)

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

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

print(N + 1 - i)
print()

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

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

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):
def examA():
    N, i = LI()
    ans = N - i + 1
    print(ans)
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

import sys,copy,bisect,itertools,heapq,math,random
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]

if __name__ == '__main__':
    examA()

"""

"""

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

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


def read_list():
    return list(read_values())


def main():
    N, i = read_values()
    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())
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+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):
x,y = map(int, input().split())

print(x-y+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-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 + 1 - i)


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

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