import math, string, itertools, fractions, heapq, collections, re,  array, bisect, sys, random, time, copy, functools





sys.setrecursionlimit(10**7)

inf = 10 ** 20

eps = 1.0 / 10**10

mod = 10**9+7

dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]

ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]





def LI(): return [int(x) for x in sys.stdin.readline().split()]

def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]

def LF(): return [float(x) for x in sys.stdin.readline().split()]

def LS(): return sys.stdin.readline().split()

def I(): return int(sys.stdin.readline())

def F(): return float(sys.stdin.readline())

def S(): return input()

def pf(s): return print(s, flush=True)





def main():

    S = input()



    # 10文字までしかないので、一個ずつ見ていっても良いのでは

    result = 10**10

    for i in range(0, len(S) - 2):

        r = min(abs(753 - int(S[i:i+3])), abs(int(S[i:i+3]) - 753))

        if r < result:

            result = r



    print(result)



main()

import math, string, itertools, fractions, heapq, collections, re,  array, bisect, sys, random, time, copy, functools





sys.setrecursionlimit(10**7)

inf = 10 ** 20

eps = 1.0 / 10**10

mod = 10**9+7

dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]

ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]





def LI(): return [int(x) for x in sys.stdin.readline().split()]

def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]

def LF(): return [float(x) for x in sys.stdin.readline().split()]

def LS(): return sys.stdin.readline().split()

def I(): return int(sys.stdin.readline())

def F(): return float(sys.stdin.readline())

def S(): return input()

def pf(s): return print(s, flush=True)





def main():

    S = input()



    # 10文字までしかないので、一個ずつ見ていっても良いのでは

    result = 10**10

    for i in range(0, len(S) - 2):

        result = min(abs(753 - int(S[i:i+3])), result)



    print(result)





main()

import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]


def LI():
    return [int(x) for x in sys.stdin.readline().split()]


def LI_():
    return [int(x) - 1 for x in sys.stdin.readline().split()]


def LF():
    return [float(x) for x in sys.stdin.readline().split()]


def LS():
    return sys.stdin.readline().split()


def I():
    return int(sys.stdin.readline())


def F():
    return float(sys.stdin.readline())


def S():
    return input()


def pf(s):
    return print(s, flush=True)


def main():
    S = input()
    # 10文字までしかないので、一個ずつ見ていっても良いのでは
    result = 10**10
    for i in range(0, len(S) - 2):
        r = min(abs(753 - int(S[i : i + 3])), abs(int(S[i : i + 3]) - 753))
        if r < result:
            result = r
    print(result)


main()

import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]


def LI():
    return [int(x) for x in sys.stdin.readline().split()]


def LI_():
    return [int(x) - 1 for x in sys.stdin.readline().split()]


def LF():
    return [float(x) for x in sys.stdin.readline().split()]


def LS():
    return sys.stdin.readline().split()


def I():
    return int(sys.stdin.readline())


def F():
    return float(sys.stdin.readline())


def S():
    return input()


def pf(s):
    return print(s, flush=True)


def main():
    S = input()
    # 10文字までしかないので、一個ずつ見ていっても良いのでは
    result = 10**10
    for i in range(0, len(S) - 2):
        result = min(abs(753 - int(S[i : i + 3])), result)
    print(result)


main()

-        r = min(abs(753 - int(S[i : i + 3])), abs(int(S[i : i + 3]) - 753)) -        if r < result: -            result = r +        result = min(abs(753 - int(S[i : i + 3])), result)