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())
ans = (x//11)*2
x%=11

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

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

num = x//11

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

Solution (Python):
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy
x = int(input())

cnt = x // 11

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

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


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

Solution (Python):
n=int(input());print(~-n%11//6--n//11*2-1)

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):
n=int(input())
print(n//11*2+(n%11+5)//6)

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

if d > 6:
    print(e*2 + 2)
elif 0 < d <= 6:
    print(e*2 + 1)
else:
    print(e*2)

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

Solution (Python):

import math
import itertools
import statistics

x = int(input())

s =  x//11

if 11*s == x:
    ans = s*2
elif 11*s < x:
    if 11*s+6 >= x:
        ans = s*2+1
    else:
        ans = s*2+2
else:
    ans = s*2-1


print(ans)

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

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

Solution (Python):

x = int(input())

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

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

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

if tmp <= 6 and tmp != 0:
    ans += 1
elif tmp == 0:
    pass
else:
    ans += 2

print(ans)

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

Solution (Python):
x = int(input())
q,mod = divmod(x,11)
count=q*2
while True:
    if mod <= 0:
        print(count)
        break
    mod -= 6
    count += 1
    if mod <= 0:
        print(count)
        break
    mod -= 5
    count += 1

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

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

y = x // 11
z = x % 11

if z == 0:
    print(y * 2)
elif z <= 6:
    print(y * 2 + 1)
else:
    print(y * 2 + 2)

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

y = x // 11
z = x % 11

if x <= 6:
    print(1)
elif z == 0:
    print(y * 2)
elif z <= 6:
    print(y * 2 + 1)
else:
    print(y * 2 + 2)

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

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

Solution (Python):
x = int(input())
ans = x//11 * 2
mod = x%11

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

print(ans)

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

Solution (Python):
x = int(input())
r,q = divmod(x, 11)
print(r*2 + (q+5)//6)

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

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

while True:
    if x<=0:
        break
    x -= 6
    cnt += 1
    if x <= 0:
        break
    x -= 5
    cnt += 1
    if x<=0:
        break
print(cnt)

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

Solution (Python):
def resolve():
    n = int(input())

    if n <= 6:
        return print(1)
    elif n <= 11:
        return print(2)
    else:
        c = n // 11
        MOD = 2 if n % 11 > 6 else 1
        if n % 11 == 0:
            MOD = 0
    print(c*2+MOD)

if __name__ == '__main__':
    resolve()

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

ans = 0

if x >= 11:
    t = x//11
    ans += t*2
    x = x%11

if x > 6:
    ans += 2
elif x <= 6 and x != 0:
    ans += 1

print(ans)

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

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

Solution (Python):
x = int(input())
ans = x // 11 * 2
x %= 11
l = [0] + [1] * 6 + [2] * 5
ans += l[x]
print(ans)

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

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    x=I()
    ans=(x//11)*2
    b=x%11
    if b==0:
        pass
    elif b<=6:
      ans+=1
    else:
        ans+=2
        
    print(ans)  
    

main()

Solution (Python):
import math
n = int(input())
q = math.floor(n/11)
r = n % 11
if r == 0: print(2*q)
elif r <= 6: print(2*q+1)
else: print(2*q+2)

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

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

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

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

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

Solution (Python):


x = int(input())

q = x//11
r = x%11

if 1 <= r <= 6:
    print(2*q+1)
elif r == 0:
    print(2*q)
else:
    print(2*q+2)

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

y = x // 11
z = x % 11

ans = 0
ans += y * 2
if z > 6:
  ans += 2
elif z > 0:
  ans += 1
  
print(ans)

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

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())
print((-(-(2*x-1)//11)))

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

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

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

mod = x%11
shou = x//11

if mod == 0:
    print(shou*2)
elif mod > 0 and 6 >= mod:
    print(shou*2+1)
else:
    print(shou*2+2)

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

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

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

main()

Solution (Python):
x = int(input())
ans = 0
if x % 11 == 0:
    ans = 2 * (x // 11)
elif x % 11 <= 6:
    ans = 2 * (x // 11) + 1
else:
    ans = 2 * (x // 11) + 2
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 fractions import gcd
 
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()
cnt = 0
ans = 0


ans += x // 11 * 2
x %= 11




if 0 < x <= 6:
    ans += 1

elif x >= 7:
    ans += 2
print(ans)

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

Solution (Python):

import sys


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


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


if __name__ == '__main__':
    main()

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

Solution (Python):
x = int(input())
count = x // 11
count2 = x % 11

if count2 == 0:
    print(count * 2)
elif count2 <= 6:
    print(count * 2 + 1)
else:
    print(count * 2 + 2)

Solution (Python):
n=int(input())
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())
if(x<=6):
    print(1)
elif(x<=11):
    print(2)
elif(x>11 and x%11==0):
    print((x//11)*2)
elif(x>11 and x%11<=6):
    print((x//11)*2+1)
elif(x>11 and x%11>6):
    print((x//11)*2+2)

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

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

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


def main():
    target = int(input())
    print(2 * int(target / 11) + ceil((target % 11) / 6))


if __name__ == '__main__':
    main()

Solution (Python):
import sys
import bisect
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
x = int(readline())

res,mod = divmod(x,11)
res*=2
if mod == 0:
    print(res)
elif mod <= 6:
    print(res+1)
else:
    print(res+2)

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


if  x % 11 <= 6 and x % 11 != 0:
    ans += 1
elif x % 11 >= 7:
    ans += 2

print(ans)

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

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

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

Solution (Python):
x=int(input())
a=x%11
if a==0:
    cnt=0
elif 0<a and a<=6:
    cnt=1
else:
    cnt=2

print(x//11*2+cnt)

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

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

Solution (Python):
a, b = divmod(int(input()), 11)
print(a * 2 + (b > 6) + 1 - (not b))

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

ret = n // 11 * 2

if n % 11 == 0:
    pass
elif (n % 11) <= 6:
    ret += 1
else:
    ret += 2

print(ret)

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

i, j = divmod(x, 11)
ans = i * 2
if 0 < j <= 6:
    ans += 1
elif 6 < j:
    ans += 2
print(ans)

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

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

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

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

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

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

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

time1 = x // 11
X = x % 11
time1 *= 2
if X > 5:
    time1 += 2
else:
    time1 += 1
print(time1)

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

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

x = int(input())

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

Solution (Python):
import math

x = int(input())
ans = (x // 11) * 2
ans += math.ceil((x%11) / 6)
print(ans)

Solution (Python):
n=int(input())
ans=(n//11)*2

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

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

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

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

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

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

p = x // 11
r = x % 11

if (r == 0):
  print(2 * p)
elif (r > 0 and r <= 6):
  print(2 * p + 1)
else:
  print(2 * p + 2)

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())
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())-1;print(x//11*2+(x%11+1>6)+1)

Solution (Python):
N=int(input())
a=N//11
ans=2*a
b=N-11*a
if 0<b<=6:
  ans+=1
elif 6<b<=10:
  ans+=2
print(ans)

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

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

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

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 functools import reduce
from bisect import bisect_left, insort_left
from heapq import heapify, heappush, heappop

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
MAP = lambda: map(int, INPUT().split())
S_MAP = lambda: map(str, INPUT().split())
LIST = lambda: list(map(int, INPUT().split()))
S_LIST = lambda: list(map(str, INPUT().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


def main():
    x = INT()

    m = x % 11
    if m == 0: a = 0
    elif 0 < m <= 6: a = 1
    else: a = 2

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


if __name__ == '__main__':
    main()

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

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

Solution (Python):

n = int(input())
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())
count = x//11
if x%11 == 0:
    print(count*2)
elif count*11+6 >= x:
    print(count*2+1)
else:
    print(count*2+2)

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

Solution (Python):

X = int(input())

cnt = X // 11
X -= 11 * cnt

cnt *= 2
sum = 0
y = 5 if cnt % 2 == 1 else 6
while sum < X:
  sum += y
  y = 6 if y == 5 else 5
  cnt += 1

print(cnt)

Solution (Python):
def solve(x):
    
    return 2 * (x // 11) + (0 if x % 11 == 0 else 1 if x % 11 <= 6 else 2)

_x = int(input())
print(solve(_x))

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

s , a = divmod(x , 11)

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

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

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

print(ans)

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

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

N = x // 11
M = x % 11

if M == 0:
  ans = 0
elif M <= 6:
  ans = 1
else:
  ans = 2

print(2*N + ans)

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

Solution (Python):
import sys

input = sys.stdin.readline


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

    x, y = divmod(N, 11)
    ans = x * 2
    if 0 < y <= 6:
        ans += 1
    elif 6 < y <= 11:
        ans += 2

    print(ans)


if __name__ == '__main__':
    main()

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

def main():
    N = int(input())
    use = N//11
    rest = N%11
    if rest == 0:
        print(2*use)
    elif rest <= 6:
        print(2*use+1)
    else:
        print(2*use+2)

if __name__ == "__main__":
    main()

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

    def _solve(x):
        if x <= 6:
            return 1

        if x <= 11:
            return 2

        base = (x // 11) * 2
        remain = x % 11
        if 0 < remain:
            base += _solve(remain)

        return base

    return _solve(X)


if __name__ == '__main__':
    res = solve()
    print(res)

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

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

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

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

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

ans = x // 11 * 2
r = x % 11

if 1 <= r <= 6:
    ans += 1
elif 7 <= r:
    ans += 2

print(ans)

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 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 solve(x):
    rot = x // (6 + 5)
    res = x % (6 + 5)
    ans = 2 * rot
    
    if 0 < res <= 6:
        ans += 1
    if 6 < res:
        ans += 2
    return ans

def main():
    x = I()
    ans = solve(x)
    print(ans)
main()

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 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 solve(x):
    rot = x // (6 + 5)
    res = x % (6 + 5)
    ans = 2 * rot
    
    if res > 0 and rot % 2 == 0:
        if res <= 6:
            ans += 1
        else:
            ans += 2
    elif res > 0 and rot % 2 == 1:
        if res <= 5:
            ans += 1
        else:
            ans += 2
    else:
        pass
    return ans

def main():
    x = I()
    ans = solve(x)
    print(ans)
    
    
    
main()

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

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

ans = 1
if X > 6 and X <= 11:
    ans = 2
elif X > 11:
    p, q = divmod(X, 11)
    ans = p*2
    if q > 0 and q <= 6:
        ans += 1
    if q > 6 and q <= 10:
        ans += 2

print(ans)

Solution (Python):
n = int(input())
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())
res = (x//11)*2
if x%11>0:
    if x%11<=6:res += 1
    else:res += 2
print(res)

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

q, r = divmod(x, 11)

print(q * 2 + (2 if r > 6 else 1 if r > 0 else 0))

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

a, b = divmod(x, 11)
a *= 2

if b > 6:
    a += 2
elif b > 0:
    a += 1

print(a)

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

per11 = x // 11
remain_per11 = x % 11

if remain_per11 >= 7:
    print(per11*2 + 2)
elif remain_per11 == 0:
    print(per11*2)
else:
    print(per11*2 + 1)

Solution (Python):
import sys
input = sys.stdin.readline
x=int(input())
print(x//11*2-(-(x%11))//6)

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

a,b=divmod(x,11)

ans=0+a*2

if b==0:
  pass
elif b>6:
  ans+=2
else:
  ans+=1
  
print(ans)

Solution (Python):
import math

X = int(input())

x = math.ceil(X / 11)

if 11 * x - 4 <= X:
  print(2 * x)
else:
  print(2 * x - 1)

Solution (Python):


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

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

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

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

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

print(ans)

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

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

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

if res == 0:
    print(ans)
elif 1 <= res <= 6:
    print(ans + 1)
elif 7 <= res <= 10:
    print(ans + 2)

Solution (Python):
import math
x = int(input())
if x <= 11:
    count = 0
    point = 0
    while True:
        point += 6
        count += 1
        if point >= x:
            break
        point += 5
        count += 1
        if point >= x:
            break
    print(count)
else:
    count = math.ceil(x/11)*2
    if count%2 != 0:
        df = 6
    else:
        df = 5
    if count/2 * 11 - df >= x:
        count -= 1
    print(count)

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

Solution (Python):
X = int(input())
def check(mid):
    if mid%2 == 0:
        point = 11*mid//2
    else:
        point = 6*(mid//2+1)+5*(mid//2)
    return point >= X
left = 0
right = 10**18
while right-left > 1:
    mid = (right+left)//2
    if check(mid):
        right = mid
    else:
        left = mid
if check(left):
    print(left)
else:
    print(right)

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

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

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

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

ans=0
if x%11>6:
    ans+=2
elif x%11>0:
    ans+=1

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

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

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

if x%11 == 0:
    pass
elif x%11 <= 6:
    ans += 1
else:
    ans += 2

print(ans)

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

if x%11 == 0:
    pass
elif x%11 <= 6:
    ans += 1
else:
    ans += 2

print(ans)

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

if x-y*11 == 0:
    pass
elif x-y*11 <= 6:
    ans += 1
else:
    ans += 2

print(ans)

Solution (Python):
def main():
    x=int(input())
    s=2*(x//11)
    t=x%11
    print(s if t<1 else s+1 if t<7 else s+2)
main()

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

Solution (Python):
from copy import deepcopy
from sys import exit,setrecursionlimit
import math
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac
import fractions
from functools import reduce
from operator import mul
import bisect
import sys
import logging
import heapq
import itertools

logging.basicConfig(level=logging.ERROR)

input = sys.stdin.readline

setrecursionlimit(1000000)


def main():
	x = int(input())
	rm = x%11
	print(2*math.floor(x/11)+math.ceil(rm/6))

main()

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

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

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

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

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

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

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

Solution (Python):
import math

N = int(input())

if (N%11 == 6):
    print(N//11*2+1)
else:
    print(math.ceil(N/11*2))

Solution (Python):

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

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

Solution (Python):
x = int(input())
ans = x // 11 + x % 11
if x % 11 >= 7:
    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())
if x < (~-x // 11 + 1) * 11 - 4:
    print(~-x // 11 * 2 + 1)
else:
    print(~-x // 11 * 2 + 2)

Solution (Python):
import sys
input = sys.stdin.readline
N = int(input())
if N % 11 == 0: print(N // 11 * 2)
elif N <= (N // 11) * 11 + 6: print(-(-N // 11) * 2 - 1)
else: print(-(-N // 11) * 2)

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

a = (x//11)*2

if (x%11) == 0:
    b = 0
elif (x%11) <= 6:
    b = 1
else:
    b = 2

print(a + b)

Solution (Python):
import sys
input = sys.stdin.readline
x = int(input())
if x <= 6:
    print(1)
    sys.exit()
elif x <= 11:
    print(2)
    sys.exit()
x_11 = x // 11
xmod11 = x % 11
if xmod11 == 0:
    print(2 * x_11)
elif xmod11 <= 6:
    print(2 * x_11 + 1)
else:
    print(2 * x_11 + 2)

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

print(answer)

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

Solution (Python):

import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf')
ans = 0 ;count = 0 ;pro = 1

x=int(input())
b=(x-1)%11
a=math.ceil(x/11)
a*=2
if b<=5:
    
    a-=1
print(a)

Solution (Python):
import sys

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

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

if __name__ == '__main__':
    ans = main()
    print(ans)

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

roll = n // 11 * 2

print(roll if n % 11  == 0 else roll + 1 if n % 11 < 7 else roll + 2 )

Solution (Python):
import sys
import math

if sys.platform =='ios':
	sys.stdin=open('Untitled.txt')
input = sys.stdin.readline
def INT(): return int(input())
def MAP(): return [int(s) for s in input().split()]

x = INT()

tmp = x//11
y = x - (5*tmp + 6*tmp)
tmp *= 2
if y:
	if y >= 7:
		tmp += 2
	else:
		tmp += 1

print(tmp)

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