Problem:
 Score : 300 points    Problem Statement Snuke has decided to play with a six-sided die. Each of its six sides shows an integer 1 through 6 , and two numbers on opposite sides always add up to 7 .  Snuke will first put the die on the table with an arbitrary side facing upward, then repeatedly perform the following operation:   Operation: Rotate the die 90° toward one of the following directions: left, right, front (the die will come closer) and back (the die will go farther). Then, obtain y points where y is the number written in the side facing upward.   For example, let us consider the situation where the side showing 1 faces upward, the near side shows 5 and the right side shows 4 , as illustrated in the figure.
If the die is rotated toward the right as shown in the figure, the side showing 3 will face upward.
Besides, the side showing 4 will face upward if the die is rotated toward the left, the side showing 2 will face upward if the die is rotated toward the front, and the side showing 5 will face upward if the die is rotated toward the back.     Find the minimum number of operation Snuke needs to perform in order to score at least x points in total.      Constraints  1 ≦ x ≦ 10^{15}  x is an integer.         Input The input is given from Standard Input in the following format:  x       Output Print the answer.        Sample Input 1 7      Sample Output 1 2       Sample Input 2 149696127901      Sample Output 2 27217477801

Solution (Python):
x=int(input())
a=x//11
b=x%11
while (a+1)*11<=x:
  a+=1
if b>6:
  print(2*a+2)
else:
  if b==0:
    print(2*a)
  else:
    print(2*a+1)

Solution (Python):
x = int(input())
a = x//11
b = x%11

if b == 0:
    print(2*a)
elif b > 6:
    print(2*a+2)
else:
    print(2*a+1)

Solution (Python):
x = int(input())
ans = 0
if 11 <= x:
    ans += 2*(x//11)
    x %= 11
if 6 <= x:
    ans += 1
    x -= 6
if x:
    ans += 1
print(ans)

Solution (Python):
x = int(input())

quotinent = x // 11
remainder = x % 11

if remainder == 0:
  print(2*quotinent)
elif remainder <= 6:
  print(2*quotinent+1)
else:
  print(2*quotinent+2)

Solution (Python):
x = int(input())

ans = (x // 11) * 2
b = x % 11
if b > 0:
    ans += 1
    if b > 6:
        ans += 1

print(ans)

Solution (Python):
x = int(input())

if x <= 6:
    print(1)
    import sys
    sys.exit()

dice = 6
ans = 0

ans = x // 11 * 2
m = x % 11
if m != 0:
    if m <= 6:
        ans += 1
    else:
        ans += 2

print(ans)

Solution (Python):
x = int(input())
ans = (x // 11) * 2
if x % 11 == 0:
    pass
elif 0 < x % 11 <= 6:
    ans += 1
else:
    ans += 2
print(ans)

Solution (Python):
x = int(input())







p, m = divmod(x, 11)
p *= 2

if m > 6:
    print(p + 2)
elif m == 0:
    print(p)
else:
    print(p + 1)

Solution (Python):
x = int(input())

div, mod = divmod(x, 11)
div *= 2

if mod > 0 and mod < 7:
    div += 1
elif mod > 6:
    div += 2

print(div)

Solution (Python):
n = int(input())
d, m = divmod(n, 11)
ans = d*2
if m > 6:
    ans += 2
elif m > 0:
    ans += 1
print(ans)

Solution (Python):
x=int(input())
tmp=x%11
ans=x//11*2
if tmp==0:
    ans+=0
elif tmp<=6:
    ans+=1
else:
    ans+=2
print(ans)

Solution (Python):
x=int(input())
ans = x//11
ans *=2
if x%11>0:
  ans+=1
if x%11>6:
  ans+=1
print(ans)

Solution (Python):
def solve():
    x = int(input())
    n = x // 11
    
    if x == 6:
        return 1
    elif x == n * 11:
        return 2 * n
    elif n * 11 < x <= n * 11 + 6:
        return 2 * n + 1
    elif n * 11 + 6 < x <= (n + 1) * 11:
        return 2 * (n + 1)

print(solve())

Solution (Python):
import math
X = int(input())


x = X//11
amari = X%11

ans = x*2+math.ceil(amari/6)
print(ans)

Solution (Python):
n = int(input())
mod = n % 11
if not mod:
  i = 0
elif mod < 7:
  i = 1
else:
  i = 2
print(2 * (n // 11) + i)

Solution (Python):
"""
10**15なので，ループで割ることを考える
1 + (6, 5)
"""

x = int(input())
count = (x // 11) * 2
x = x % 11
if x > 6:
    print(count+2)
elif x > 0:
    print(count+1)
else:
    print(count)

Solution (Python):
import sys

x = int(sys.stdin.readline().strip())

"""
1
5423
6
"""

r = x // 11
res = x - 11*r
if res == 0:
    print(2*r)
elif res > 6:
    print(2*r + 2)
else:
    print(2*r + 1)

Solution (Python):
from math import ceil
x = int(input())
ans = x // 11 * 2
ans += ceil((x%11)/6)
print(ans)

Solution (Python):
x = int(input())
a = x // 11
b = x % 11
if b == 0:
    print(2 * a)
elif b > 6:
    print(2 * a + 2)
else:
    print(2 * a + 1)

Solution (Python):
x = int(input())

if x <= 6:
    print(1)
elif x <= 11:
    print(2)
else:
    ans = (x // 11) * 2
    tmp = x % 11
    if tmp == 0:
        print(ans)
    elif tmp <= 6:
        print(ans+1)
    else:
        print(ans+2)

Solution (Python):
a = int(input())
x = (a // 11) * 2
if a % 11 > 6:
    x += 2
elif a % 11 > 0:
    x += 1
print(x)

Solution (Python):
N = int(input())
q, mod = divmod(N , 11)
q *= 2

ans = 0
if mod == 0:
  ans = q
elif 1 <= mod <= 6:
  ans = q + 1
else:
  ans = q + 2

print(ans)

Solution (Python):
X = int(input())

div11 , mod = divmod(X,11)
div6, mod = divmod(mod,6)
num = 1 if mod > 0 else 0
ans = div11 * 2 + div6 + num

print(ans)

Solution (Python):
x = int(input())
print((x-1)//11*2+int((x-1)%11>=6)+1)

Solution (Python):
N = int(input())
if not N % 11:
  print(N // 11 * 2)
elif N % 11 <= 6:
  print(N // 11 * 2 + 1)
else:
  print(N // 11 * 2 + 2)

Solution (Python):
A=int(input())
ans=A//11*2
A-=A//11*11
if 1 <= A <= 6:
   print(ans+1)
elif A==0:
   print(ans)
else:
   print(ans+2)

Solution (Python):
import sys
import re
import math
import collections
import decimal
import bisect
import itertools
import fractions
import functools
import copy
import heapq
import decimal

sys.setrecursionlimit(10000001)
INF = sys.maxsize
MOD = 10 ** 9 + 7

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



def main():
    x = ni()

    base = x // 11 * 2
    mod = x % 11
    if mod == 0:
        hoge = 0
    elif mod > 6:
        base += 2
    else:
        base += 1

    print(base)


if __name__ == '__main__':
    main()

Solution (Python):

import collections
import itertools as it
import math

 

x  = int(input())






n11 = (x // 11)
rest = x - n11 * 11
rest6 = int(bool(rest % 6))
rest5 = int(bool(rest // 6 % 5))

print(n11 * 2 + rest6 + rest5)

Solution (Python):


x = int(input())

if x % 11 == 0:
    tmp = 0
elif x % 11 < 7:
    tmp = 1
else:
    tmp = 2
print(x//11 * 2 + tmp)

Solution (Python):

x = int(input())
p, q = divmod(x, 11)
s = max(q - 6, 0)
print(p*2 + ([1,2][s>0] if q else 0))

Solution (Python):
x = (int)(input())
temp = 0
if x % 11 != 0:
    if x % 11 < 7:
        temp = 1
    else:
        temp = 2
print((int)(x/11) * 2 + temp)

Solution (Python):
x = int(input())

c = x // 11

if c * 11 == x:
    print(c * 2)
elif (c * 11 + 5 >= x) or (c * 11 + 6 >= x):
    print(c * 2 + 1)
else:
    print(c * 2 + 2)

Solution (Python):
x = int(input())
ans = x // 11
x -= ans * 11

if x == 0:
  print(ans * 2)
  
elif x <= 6:
  print(ans * 2 + 1)

else:
  print(ans * 2 + 2)

Solution (Python):
x=int(input())
s=(x//11)*2
a=x%11
if a>0:
    s+=1
if a>6:
    s+=1
print(s)

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    x = int(input())

    q, r, = divmod(x, 11)
    if r == 0:
        ans = 2 * q
    elif r <= 6:
        ans = 2 * q + 1
    else:
        ans = 2 * q + 2

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
import math
N = int(input())
print((N//11)*2+math.ceil((N%11)/6))

Solution (Python):
x = int(input())

if x<=6:
    print(1);exit()
if x<=11:
    print(2);exit()
ans=(x//11)*2
b = x-x//11*11
if b==0:
    pass
elif 0<b<=6:
    ans+=1
else:
    ans+=2
print(ans)

Solution (Python):
x = int(input())
if x % 11 == 0:
    print((x // 11) * 2)
elif x % 11 < 7:
    print((x // 11) * 2 + 1)
else:
    print((x // 11) * 2 + 2)

Solution (Python):
x = int(input())
ans = x//11*2 + (x%11+5)//6

print(ans)

Solution (Python):
from math import ceil
x = int(input())
if x % 11 == 0:
    print((x // 11) * 2)
else:
    print((x // 11) * 2 + 2 if x % 11 > 6 else (x // 11) * 2 + 1)

Solution (Python):
n=int(input())
if n<7: 
  print(1);exit()
print(n//11*2+(n%11>0)+(n%11>6))

Solution (Python):
import sys
input = sys.stdin.readline
def main():
    x = int(input())
    ans = (x//11)*2
    rest = x % 11
    if rest > 6:
        ans += 2
    elif 0 < rest <= 6:
        ans += 1
    print(ans)
if __name__ == "__main__":
    main()

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


def readstr():
    return input().strip()


def readint():
    return int(input())


def readnums():
    return map(int, input().split())


def readstrs():
    return input().split()


x = readint()

if x % 11 > 6:
    print(x // 11 * 2 + 2)
elif x % 11:
    print(x // 11 * 2 + 1)
else:
    print(x // 11 * 2)

Solution (Python):
def main():
    x = int(input())
    answer = (x // 11) * 2
    if 1 <= x % 11 <= 6:
        answer += 1
    elif 7 <= x % 11:
        answer += 2
    print(answer)


if __name__ == '__main__':
    main()

Solution (Python):

import sys

def main():
    x = int(input())
    ans = 2 * (x // 11)
    if x % 11 > 6:
        print(ans + 2)
    elif x % 11 > 0:
        print(ans + 1)
    else:
        print(ans) 

if __name__ == '__main__':
    main()

Solution (Python):
x = int(input())
ans = (x//11)*2
ans += x%11>6
ans += x%11 > 0
print(ans)

Solution (Python):
x = int(input())

if x % 11 == 0:
    ans = x // 11 * 2
else:
    if x % 11 <= 6:
        ans = x // 11 * 2 + 1
    else:
        ans = (x // 11 + 1) * 2

print(ans)

Solution (Python):
N=int(input())

turn=N//11*2

if N%11>6:
    print(turn+2)
elif N%11>0:
    print(turn+1)
else:
    print(turn)

Solution (Python):
x = int(input())
if x <= 6:
    print(1)
    exit()
a = x // 11
sum = 11 * a
i = 2 * a
if sum < x:
    if x - sum > 6:
        i += 1
    i += 1
    
print(i)

Solution (Python):
x = int(input())
cnt = x // 11 * 2
mod = x % 11
print(cnt + -(-mod//6))

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

x = I()
y = x % 11
ans = (x // 11) * 2
if y == 0:
    pass
elif y <= 6:
    ans += 1
else:
    ans += 2
print(ans)

Solution (Python):
def main():
    x = int(input())

    q, r = divmod(x, 11)
    ans = q * 2
    if r == 0:
        pass  
    elif r <= 6:
        ans += 1
    else:
        ans += 2
    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
x = int(input())
if x<11:
    print(1 if x <= 6 else 2)
else:
    ans = x // 11 * 2
    x -= (x // 11) * 11
    if x != 0 and x <= 6:
        ans += 1
    elif x != 0 and x>6:
        ans += 2
    print(ans)

Solution (Python):
x=int(input())


ans=(x//11)*2
if 6<(x%11):
    ans+=2
elif 1<=(x%11) and (x%11)<=6:
    ans+=1
print(ans)

Solution (Python):
x = int(input())
ans = (x//11)*2
if x%11 == 0:a= 1
elif x%11> 0 and x%11 <=6:
    ans += 1
else:ans += 2
print(ans)

Solution (Python):
x=int(input())
cnt=(x//11)*2
if x%11 >6:
    cnt+=2
elif 0< x%11 <=6:
    cnt+=1

print(cnt)

Solution (Python):
x=int(input())
ans=-(-(x*2-1)//11)
print(ans)

Solution (Python):
x = int(input())
right = x//11+1 if x//11 != x/11 else x//11
if right*11 - x < 5:
    print(right*2)
else:
    print(right*2-1)

Solution (Python):
si = lambda: input().strip()
ii = lambda: int(input())
mii = lambda: map(int, input().split())
lmii = lambda: list(map(int, input().split()))
lmsi = lambda: list(map(str, input().split()))
smii = lambda: sorted(map(int, input().split()))



x = ii()

d, m = divmod(x, 11)

ans = 2 * d
if m > 0:
    ans += 1
    if m > 6:
        ans += 1

print(ans)

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from heapq import heapify, heappop, heappush
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

x = INT()

if x % 11 == 0:
    tmp = 2 * x // 11

else:
    if 6 < x % 11:
        tmp = 2 + 2 * (x // 11)
    else:
        tmp = 1 + 2 * (x // 11)
print(tmp)

Solution (Python):
def I(): return int(input())
x = I()
div,mod = divmod(x,11)
print(div*2+(0 if mod==0 else 1 if mod<=6 else 2))

Solution (Python):
x = int(input())
if x%11 == 0:
    print(2*x//11)
else:
    print(2 + 2*(x//11) if 6<(x%11) else 1 + 2*(x//11))

Solution (Python):
def solve():
    X = int(input())
    num, mod = divmod(X,11)
    print(2*num+(mod+5)//6)



if __name__ == '__main__':
    solve()

Solution (Python):
x = int(input())
s, r = divmod(x, 11)
s *= 2
if r > 6:
    s += 2
elif 1 <= r <= 6:
    s += 1
print(s)

Solution (Python):
x = int(input())

y = (x-1)//11
z = (x-1)%11

u = 2*(y+1)

if z < 6:
    u -= 1
    

print(u)

Solution (Python):
def main():
    x = int(input())
    ans = (x // 11) * 2
    if x % 11 == 0:
        pass
    elif x % 11 <= 6:
        ans += 1
    else:
        ans += 2
    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
x = int(input())
n = x//11
k = x%11
if k==0:
    print(2*n)
elif 0<k<=6:
    print(2*n+1)
else:
    print(2*n+2)

Solution (Python):
x = int(input())
ans = x // 11
m = x % 11

ans *= 2
if m > 6:
  ans += 2
elif m != 0:
  ans += 1
print(ans)

Solution (Python):
import math
x = int(input())
ans = min((x//11)*2 + math.ceil((x%11)/5),(x//11)*2 + math.ceil((x%11)/6))
print(ans)

Solution (Python):
n=int(input())
ans=1
if n%11>6:
  ans+=1
k=n//11
if (k+1)*11<=n:
  k+=1
if n%11==0:
  print(2*k)
else:
  print(2*k+ans)

Solution (Python):
x = int(input())

num = x // 11

x %= 11
if x == 0:
    print(num * 2)
elif x <= 6:
    print(num * 2 + 1)
else:
    print(num * 2 + 2)

Solution (Python):
x = int(input())

if x % 11 == 0:
    print((x//11)*2)
elif x % 11 > 6:
    print((x//11)*2 + 2)
else:
    print((x//11)*2 + 1)

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

n = int(readline())
ans = n // 11 * 2
if 1 <= n % 11 <= 6:
    ans += 1
elif 7 <= n % 11 <= 10:
    ans += 2
print(ans)

Solution (Python):


import sys
input= lambda: sys.stdin.readline().rstrip()
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))

def resolve():
    N,=pin()
    a,b=(N//11,N%11)
    
    ans=a*2
    if b>0:
        ans+=1
        if b>6:ans+=1
    print(ans)

resolve()

Solution (Python):
def resolve():
    x = int(input())
    mod = x%11
    div = x//11
    if mod==0:
        print(div*2)
    elif mod <= 6:
        print(div*2 + 1)
    else:
        print(div*2+2)

resolve()

Solution (Python):
x = int(input())

if x % 11 == 0:
    print((x//11)*2)
elif x % 11 > 6:
    print((x//11)*2 + 2)
else:
    print((x//11)*2 + 1)

Solution (Python):
x=int(input())
a=x//11
p,q=divmod(x,11)
if q==0:
  print(p*2)
elif q<=6:
  print(p*2+1)
else:
  print(p*2+2)

Solution (Python):
x = int(input())

ans = (x//11)*2
p = x % 11
if p == 0:
    print(ans)
elif 1 <= p <= 6:
    print(ans+1)
elif 7<= p:
    print(ans+2)

Solution (Python):
def main():
    x = int(input())

    ans = ((x + 10) // 11) * 2 - 1
    if (x + 10) % 11 > 5:
        ans += 1

    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
x = int(input())
print((x//11)*2 + (x%11!=0) + (x%11>6))

Solution (Python):
x = int(input())

count = (x // 11) * 2

x %= 11
if x == 0:
    pass
elif 6 >= x:
    count += 1
else:
    count += 2

print (count)

Solution (Python):
x=int(input())

ans=0
q,r=divmod(x,11)
ans+=2*q
q,r=divmod(r,6)
ans+=q
if r>0:
  ans+=1
print(ans)

Solution (Python):
x=int(input())
ans=2*(x//11)
x%=11
if x==0:
    ans+=0
elif x<=6:
    ans+=1
else:
    ans+=2
print(ans)

Solution (Python):
X = int(input())
d, m = divmod(X, 11)

d *= 2
if m > 6:
    d += 2
elif m > 0:
    d += 1
print(d)

Solution (Python):
def point(mid):
    ans = 0
    ans += (mid // 2) * 11
    mid -= (mid // 2) * 2
    ans += mid * 6
    return ans >= x

x = int(input())

ok = 10 ** 18
ng = 0
while abs(ok - ng) > 1:
    mid = (ok + ng) // 2
    if point(mid):
        ok = mid
    else:
        ng = mid
print(ok)

Solution (Python):


import sys
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)

x = int(readline())

q = (x + 10) // 11
tot = 0
if 11 * q - x >= 5:
    tot -= 1

tot += q * 2
print(tot)

Solution (Python):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

n = inp()
a = n//11
b = n%11
res = 0
if b > 6:
    res = 2
elif b > 0:
    res = 1
else:
    res = 0
print(a*2 + res)

Solution (Python):
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_tuple(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_col(H):
    '''
    H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) 
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_matrix(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    


MOD = 10**9 + 7
INF = 2**31  

from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  




x = read_a_int()
ans = (x // 11) * 2
nokori = x % 11
if nokori > 0:
    nokori -= 6
    ans += 1
if nokori > 0:
    nokori -= 5
    ans += 1
print(ans)

Solution (Python):
x = int(input())
if x==1:
    print(1)
else:
    tmp1 = (x-1)%11
    tmp2 = (x-1)//11
    if tmp1 > 5:
        print(2*tmp2 + 2)
    else:
        print(2*tmp2 + 1)

Solution (Python):
x=int(input())
print(x//11*2+(x%11+5)//6)

Solution (Python):
x = int(input())
n = x // 11
a = x % 11
add = 0
if 0 < a <=6:
    add += 1
elif a > 6:
    add += 2
print(add+n*2)

Solution (Python):
x=int(input())
ans=2*(x//11)
if x%11 == 0:
  print(ans)
elif x%11 <= 6:
  print(ans+1)
else:
  print(ans+2)

Solution (Python):
x=int(input())
ans=2*(x//11)
x-=11*(x//11)
if x==0:
    print(ans)
elif x<=6:
    print(ans+1)
else:
    print(ans+2)

Solution (Python):
from math import ceil

X = int(input())

if X <= 6:
    print(1)
    exit(0)

r = X % 11


if r == 0:
    print((X // 11) * 2)
elif r <= 6:
    print(ceil(X / 11) * 2 - 1)
else:
    print(ceil(X / 11) * 2)

Solution (Python):
x=int(input())
if x%11>0:
  if (x%11)%6!=0:
    ans=2*(x//11)+((x%11)//6)+1
  else:
    ans=2*(x//11)+1
else:
  ans=2*(x//11)
print(ans)

Solution (Python):
x = int(input())


k = x // 11

ans = k * 2
if x - k * 11 == 0:
    ans += 0
elif x - k * 11 <= 6:
    ans += 1
else:
    ans += 2
print(ans)

Solution (Python):
x = int(input())

cnt, q = divmod(x, 11)

cnt *= 2

if 0 < q <= 6:
    cnt += 1
elif q > 6:
    cnt += 2

print(cnt)

Solution (Python):
X = int(input())

d, m = divmod(X, 11)

ans = 2 * d
if m > 6:
    ans += 2
elif m > 0:
    ans += 1

print(ans)

Solution (Python):
x=int(input())

if x%11==0:
    print((x//11)*2)
    exit()

if 0<x%11<7:
    print((x//11)*2+1)
    exit()

print((x//11)*2+2)

Solution (Python):
x = int(input())

if x <= 6:
    print(1)
elif x <= 11:
    print(2)
else:
    ans = (x//11)*2
    if x % 11 != 0:
        ans += 1
    if x % 11 >= 7:
        ans += 1
    print(ans)

Solution (Python):
x = int(input())
if x%11 == 0:
    print((x//11)*2)
elif x%11 <= 6:
    print((x//11)*2 + 1)
else:
    print((x//11)*2 + 2)

Solution (Python):
x=int(input())
ans=0
q,r=divmod(x,11)
ans+=2*q
q,r=divmod(r,6)
ans+=q
if r>0:ans+=1
print(ans)

Solution (Python):
x = int(input())
ans1 = x//11
ans2 = x%11
if ans2 > 6:
    ans2 = 2
elif ans2==0:
    ans2 = 0
else:
    ans2 = 1
print(2*ans1+ans2)

Solution (Python):
x=int(input())
ans=x//11
if(ans*11==x):
    print(ans*2)
elif(x<=(ans*11)+6):
    print(ans*2 + 1)
else:
    print(ans*2 +2)

Solution (Python):
from math import ceil
x = int(input())
print(2*ceil(x/11)-(((x-1)%11)<=5))

Solution (Python):
x=int(input())
ans=(x//11)*2
amari=x%11
if 0<amari<7:
  ans+=1
elif amari>6:
  ans+=2
print(ans)

Solution (Python):
def main():
    X = int(input())
    ans = 0
    ans += (X//11)*2
    X %= 11
    if 6 < X:
        ans += 2
    elif 1 <= X:
        ans += 1

    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
x = int(input())
ans = x // 11
m = x % 11

ans *= 2
if m > 6:
  ans += 2
elif m != 0:
  ans += 1
print(ans)

Solution (Python):
from math import ceil


def main():
    x = int(input())
    answer = ceil(x / 11)
    if 1 <= x % 11 <= 6:
        answer = answer * 2 - 1
    else:
        answer *= 2
    print(answer)


if __name__ == '__main__':
    main()

Solution (Python):
x=int(input())
ans=0
d,m=divmod(x,11)
ans+=d*2
ans+=1 if m else 0
ans+=1 if m > 6 else 0
print(ans)

Solution (Python):

from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    x = I()
    s = (x-1)//11
    x -= s*11
    ans = s*2
    if x < 7:
        ans += 1
    else:
        ans += 2
    print(ans)
    return


if __name__ == "__main__":
    solve()

Solution (Python):
X = int(input())
d,m = divmod(X-1,11)
ans = 1 + d*2 + (m>=6)
print(ans)

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

x = INT()

ans = 2*(x//11)
x %= 11

if 1 <= x <= 6:
    ans += 1
elif 6 < x: 
    ans += 2
print(ans)

Solution (Python):
x = int(input())


ans = x // 11
x -= 11 * ans
ans *= 2
if x > 6:
    ans += 2
elif x > 0:
    ans += 1
print(ans)

Solution (Python):
x = int(input())

n_11 = x // 11

x_tmp = x % 11

if x_tmp > 6:
    ans = 2 * n_11 + 2
elif x_tmp > 0:
    ans = 2 * n_11 + 1
else:
    ans = 2 * n_11

print(ans)

Solution (Python):
n = int(input())
if n < 11:
    if n <= 6:
        print(1)
    else:
        print(2)
    exit()
if n%11 == 0:
    print((n//11)*2)
elif n%11 <=6:
    print((n//11)*2 + 1)
else:
    print((n//11)*2 + 2)

Solution (Python):
x = int(input())
q, r = divmod(x, 11)
if r == 0:
    print(2*q)
elif 0 < r <= 6:
    print(2*q+1)
else:
    print(2*q+2)

Solution (Python):
n=int(input())
ans=n//11*2
n%=11
if 1<=n<=6:ans+=1
if 7<=n:ans+=2
print(ans)

Solution (Python):
x = int(input())
q, mod = divmod(x, 11)
if mod == 0:
    ans = q * 2
elif mod > 6:
    ans = q * 2 + 2
else:
    ans = q * 2 + 1
print(ans)

Solution (Python):
import math
x = int(input())
mod = x%11
print((x//11)*2 + math.ceil(mod/6))

Solution (Python):
x = int(input())

mod = x%11
ans = (x//11)*2

if 6 < mod:
    ans += 2
elif 0 < mod <= 6:
    ans += 1

print(ans)

Solution (Python):
x = int(input())

ans = int(x/11)*2
if x%11>6:
    ans += 2
elif x%11>0:
    ans += 1
print(ans)

Solution (Python):
d,m=divmod(int(input()),11);print(2*d+(m>0)+(m>6))

Solution (Python):
x = int(input())

ans = (x // 11) * 2
sub = x % 11
if sub >= 7:
    ans += 2
elif 0 < sub <= 6:
    ans += 1

print(ans)

Solution (Python):
x = int(input())
if (x%11) == 0:
    print((x//11)*2)
elif (x%11) <= 6:
    print((x//11)+(x//11)+1)
elif (x%11) > 6:
    print((x//11)+(x//11)+2)

Solution (Python):

x = int(input())

if x <= 6:
    ans = 1
elif 7 <= x <= 11:
    ans = 2
else:
    tmp = x // 11
    if 11 * tmp == x:
        ans = 2 * tmp
    if 11 * tmp < x <= 11 * tmp + 6:
        ans = 2 * tmp + 1
    if 11 * tmp + 6 < x < 11 * tmp + 11:
        ans = 2 * tmp + 2
print(ans)

Solution (Python):
x = int(input())
cnt = 0
cnt += x // 11 * 2
x %= 11
if 1 <= x <= 6:
    cnt += 1
elif 7 <= x <= 10:
    cnt += 2
print(cnt)

Solution (Python):
n=int(input())
ans=0
x=n//11
ans+=2*x
n-=11*x
if n>=7:
    ans+=2
elif 0<n<=6:
    ans+=1
print(ans)

Solution (Python):
x = int(input())
ans = x // 11
m = x % 11

ans *= 2
if m > 6:
  ans += 2
elif m != 0:
  ans += 1
print(ans)

Solution (Python):
x = int(input())
if x%11 > 6:
    ans = x//11 *2 +2
elif x %11==0:
    ans = x//11 *2
else:
    ans = x//11 *2 +1
print(ans)

Solution (Python):
x = int(input())
x,y=divmod(x, 11)
if y > 6:
    print(2*x+2)
elif y > 0:
    print(2*x+1)
else:
    print(2*x)

Solution (Python):
x = int(input())
ans = x // 11 * 2
if x % 11 >= 7:
    ans += 2
elif x % 11 == 0:
    pass
else:
    ans += 1
print(ans)

Solution (Python):
n = int(input())
ans = n // 11
m = n % 11

ans *= 2
if m > 6:
    ans += 2
elif m != 0 :
    ans += 1
print(ans)

Solution (Python):
x = int(input())
nums = [i for i in range(6, 0, -1)]

if x % 11 == 0:
    ans = (x // 11) * 2
else:
    if x % 11 <= 6:
        ans = (x // 11) * 2 + 1
    else:
        ans = (x // 11 + 1) * 2
print(ans)

Solution (Python):


x = int(input())
d,m = divmod(x,11)
ans = d*2
ans += 1

if m > 6:
    ans += 1
elif m == 0:
    ans -= 1
print(ans)

Solution (Python):
x = int(input())

tmp = x // 11
nokori = x % 11
if nokori == 0:
    print(tmp * 2)
elif nokori > 6:
    print(tmp * 2 + 2)
else:
    print(tmp * 2 + 1)

Solution (Python):
import sys

def solve():
    input = sys.stdin.readline
    X = int(input())
    if 0 < X % 11 <= 6: print(((X - 1) // 11 + 1) * 2 - 1)
    else: print(((X - 1) // 11 + 1) * 2)

    return 0

if __name__ == "__main__":
    solve()

Solution (Python):
n = int(input())
if n < 11:
    if n <= 6:
        print(1)
    else:
        print(2)
    exit()
if n%11 == 0:
    print((n//11)*2)
elif n%11 <=6:
    print((n//11)*2 + 1)
else:
    print((n//11)*2 + 2)

Solution (Python):
x = int(input())
ans = x//11*2
if x%11!=0:
    c = x%11
    if c <=6:ans+=1
    else:ans+= 2
print(ans)

Solution (Python):
n = int(input())
if n < 11:
    if n <= 6:
        print(1)
    else:
        print(2)
    exit()
if n%11 == 0:
    print((n//11)*2)
elif n%11 <=6:
    print((n//11)*2 + 1)
else:
    print((n//11)*2 + 2)

Solution (Python):
x = int(input())
cnt = 1
if x % 11 >= 7:
    cnt += 1
cnt += int(x/11) * 2
if x % 11 == 0:
    print(x//11*2)
else:
    print(cnt)

Solution (Python):


x = int(input())

p,q = divmod(x, 11)
p *= 2
if q == 0:
    pass
elif q <= 6:
    p += 1
else:
    p += 2

print(p)

Solution (Python):
def ABC67_B():
    N, K = LI()
    L = LI()
    L.sort(reverse=True)
    ans = sum(L[:K])
    print(ans)
    return

def ABC100_C():
    def factorization_2(n):
        arr = defaultdict(int)
        temp = n
        i = 2
        if temp % i == 0:
            cnt = 0
            while temp % i == 0:
                cnt += 1
                temp //= i
            arr[i] = cnt
        if temp != 1:
            arr[temp] = 1
        if arr == []:
            arr[n] = 1
        return arr[2]
    N = I()
    A = LI()
    ans = 0
    for a in A:
        ans += factorization_2(a)
    print(ans)
    return

def ARC68_C():
    X = I()
    ans = 0
    ans += 2*(X//11)
    rest = X%11
    if rest>0:
        ans += 1
    if rest>=7:
        ans += 1
    print(ans)
    return

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

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

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

import sys,bisect,itertools,heapq,math,random
from copy import deepcopy
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)]

sys.setrecursionlimit(10**6)

if __name__ == '__main__':
    ARC68_C()

"""

"""

Solution (Python):
x = int(input())

ans = x // 11 * 2
if x % 11 >= 7:
    ans += 2
elif x % 11 == 0:
    pass
else:
    ans += 1
print(ans)

Solution (Python):
x = int(input())

if x % 11 == 0:
    ans = x // 11 * 2
elif 0 < x % 11 <= 6:
    ans = x // 11 * 2 + 1
else:
    ans = x // 11 * 2 + 2
print(ans)

Solution (Python):
x=int(input())
print((x//11)*2 + (x%11) // 6 + (1 if x%11%6 else 0))

Solution (Python):
x = int(input())

x_tmp = x

n_6_5 = x_tmp // 11
x_tmp -= 11 * n_6_5

if x_tmp == 0:
    n_6 = n_5 = 0
elif x_tmp <= 6:
    n_6, n_5 = (1, 0)
else:
    n_6, n_5 = (1, 1)

print(2 * n_6_5 + n_6 + n_5)

Solution (Python):
def main():
    x = int(input())
    ans = (x//11) * 2
    x %= 11
    if 6 < x:
        ans += 2
    elif 0 < x:
        ans += 1
    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
def resolve():

    x=int(input())
    p,mod=divmod(x,11)

    if mod==0:
        print(p*2)
    elif mod<=6:
        print((p+1)*2-1)
    else:
        print((p+1)*2)

resolve()

Solution (Python):
x = int(input())-1
d,m = divmod(x,11)
ans = d*2 + 1 + int(m>=6)
print(ans)