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




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


if __name__ == "__main__":
    main()

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 - 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):
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 = [int(i) for i in input().split()]

output = N - i + 1

print(output)

Solution (Python):
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):
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):
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):

import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
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):
import sys
sys.setrecursionlimit(10**9)
INF=10**18
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):
"""
author : halo2halo
date : 23, Jan, 2020
"""

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

ans = N - i + 1

print(ans)

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

Solution (Python):
def main():
    from sys import stdin, setrecursionlimit
    setrecursionlimit(10**6)
    r = stdin.readline()[:-1]
    
    
    

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

if __name__ == '__main__':
    main()

Solution (Python):
import sys

INPUT = lambda: sys.stdin.readline().rstrip()
MAP = lambda: map(int, INPUT().split())

sys.setrecursionlimit(10 ** 9)


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


if __name__ == '__main__':
    main()

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

Solution (Python):
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def my_round(a,dig=0):
    p = 10 ** dig
    return (a * p * 2 + 1) // 2 / p

def gcd(a,b): 
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

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

def divisors(a): 
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): 
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): 
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): 
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

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

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

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

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

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

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

Solution (Python):
import sys

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

def main():
    return n + 1 - i

if __name__ == '__main__':
    ans = main()
    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 + 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):
a,b=map(int,input().split())
print(a-b+1)

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

print(a - b + 1)

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

print(N-i+1)

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

Solution (Python):
import sys
input = sys.stdin.readline
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):
a,b=map(int, input().split())
print(a-b+1)

Solution (Python):
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

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

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7


n, i = list(map(int, sys.stdin.buffer.readline().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, i) = [int(i) for i in input().rstrip().split(" ")]

ans = n - i + 1
print(ans)

Solution (Python):
N,i=tuple(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+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-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 = input().split()
total = int(input[0])
front = int(input[1])

if(total<1 or total>100):
  sys.stderr.write('Error occurred!')
elif(front<1 or front > total):
  sys.stderr.write('Error occurred!')
else:  
  locationFromBack = (total-front) + 1
  print(locationFromBack)

Solution (Python):
import sys

input = input().split()
total = int(input[0])
front = int(input[1])

if(total<1 or total>100):
  sys.stderr.write('Error occurred!')
elif(front<1 or front > total):
  sys.stderr.write('Error occurred!')
else:  
  locationFromBack = (total-front) + 1
  print(locationFromBack)

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

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

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    n,i=INTM()
    print(n-i+1)
if __name__ == '__main__':
    do()

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

    print(n+1-i)

if __name__ == '__main__':
    main()

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

Solution (Python):
import math

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

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

print(n - i + 1)

Solution (Python):
a, b = input().split()
print(int(a)-int(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):
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):
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=map(int,input().split())
print(A-B+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-(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, m = map(int, input().split())
print(n-m+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=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):
if __name__ == '__main__':
    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().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
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

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

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

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

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

N=int(N)
i=int(i)

n=N-i+1

print(n)

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

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

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

Solution (Python):

import math



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

Solution (Python):
import sys,itertools
def input():
    return sys.stdin.readline()[:-1]

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

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

if N == 1 and i == 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):
N, i = [int(num) for num in 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)



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

ans = N - i + 1
print(ans)

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

ret=n-i+1

  
print(ret)

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

print(N + 1 - K)

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 permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

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

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

Solution (Python):
from sys import stdin
import collections

n,i = [int(x) for x in stdin.readline().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):
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())
answer = n - i + 1
print(answer)

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

print(N - i + 1)

Solution (Python):
import sys
def input():
    return sys.stdin.readline()[:-1]

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

Solution (Python):




import sys














def main():
    n, i = (int(x) for x in sys.stdin.readline().split())
    j = n - i + 1
    print(j)


if __name__ == "__main__":
    
    main()

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

print(n-i+1)

Solution (Python):



N, i = map(int, open(0).read().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-i+1)

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

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

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


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

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

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())
list1=[x+1 for x in range(0,1000)]
list2=[y for y in range(1,N+1)]
if N in list1 and i in list2:
     x=(N-i)+1 
     print(x)

Solution (Python):
N,i=map(int,input().split())
list1=[x+1 for x in range(0,1000)]
list2=[y for y in range(1,N+1)]
if N in list1 and i in list2:
     x=(N-i)+1 
     print(x)

Solution (Python):
s=input().split()
N=int(s[0])
i=int(s[1])
j = N - i +1
print(j)

Solution (Python):
s=input().split()
N=int(s[0])
i=int(s[1])
j = N - i +1
print(j)

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 = 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 input():
    return sys.stdin.readline()[:-1]
N,i = map(int,input().split(' '))
print(N+1-i)

Solution (Python):
N, i=map(int, 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):
import sys
input = sys.stdin.readline
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())
j = N - i + 1
print(j)

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

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

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

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

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

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

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

Solution (Python):

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

Solution (Python):
def train():
    n = input().split(" ")
    j = (int(n[0])-int(n[1]))+1
    print(j)
    
    


train()

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

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

print(N - (i-1))

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


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

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

if __name__ == "__main__":
    main()

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

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

Solution (Python):
'''A - Train
https://atcoder.jp/contests/abc107/tasks/abc107_a

>>> main(4, 2)
3
>>> main(1, 1)
1
>>> main(15, 11)
5'''


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


if __name__ == '__main__':
    n, i = map(int, input().split(' '))
    main(n, 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(str(N - i + 1))

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

print(a-b+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):
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    n, i = list(map(int, input().rstrip('\n').split()))
    print(n - i + 1)


if __name__ == '__main__':
    slove()

Solution (Python):
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):
X = list(map(int, input().split()))
print(X[0]-X[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):
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=[int(s) for s in 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(5 * 10**5)
input = sys.stdin.readline

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

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

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

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

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

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

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

print(N-i+1)