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



Sample input:
7


Sample output:
2

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

q, r = divmod(x, 11)

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

Submission status: Accepted

Solution code:
x = int(input())

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

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

print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

X = int(input())

x = math.ceil(X / 11)

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

N = int(input())

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

Submission status: Accepted

Solution code:
#053C X: Yet Another Die Game
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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
if x < (~-x // 11 + 1) * 11 - 4:
    print(~-x // 11 * 2 + 1)
else:
    print(~-x // 11 * 2 + 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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:
    # print(a,b)
    a-=1
print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

roll = n // 11 * 2

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())/11
print(int(x+0.95)+int(x+0.4))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
count_t = n // 11
amari = n % 11
count = 0
if amari > 6:
    count = 2
elif amari > 0:
    count = 1
print(count_t * 2 + count)

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

print(ans)

Submission status: Accepted

Solution code:
import math
x = int(input())
a , f = math.modf(x / 11)
ans = f * 2
#print(f , a)
if a > 0.6:
    ans += 2
elif a > 0:
    ans += 1
print(int(ans))

Submission status: Accepted

Solution code:
a, b = divmod(int(input()), 11)
print(2*a + (b > 0) + (b > 6))

Submission status: Accepted

Solution code:


X = int(input())

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

print(cnt)

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    X=I()
    ans = X//11*2
    if X%11==0:
        pass
    elif (X-X//11*11)<=6:
        ans += 1
    else:
        ans += 2
    print(ans)
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())
ans = n//11*2
n -= n//11*11
for i in [6,5]:
    if n <= 0:
        break
    n -= i
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
x=int(input())
div = x//11
rem = x%11

if(rem==0):
    print(2*div)
elif(rem>6):
    print(2*div+2)
else:
    print(2*div+1)

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
turn=(N//11)*2
rest=N%11
if rest>0 and rest<=6:
  print(turn+1)
elif rest>6:
  print(turn+2)
else:
  print(turn)

Submission status: Accepted

Solution code:
from sys import stdin

n = int(stdin.readline().rstrip())
print((n-1)*2//11+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
    x=int(input())
    ans=2*(x//11)
    x%=11
    if(x==0):
        print(ans)
    elif(x<7):
        print(ans+1)
    else:
        print(ans+2)
resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
a,b = divmod(x,11)
ans = a * 2
if b > 6:
  ans += 2
elif 1 <= b <= 6:
  ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
counter = x // 11 * 2
mod = x % 11
if mod >= 1 and mod <= 6:
  counter += 1
elif mod >= 7:
  counter += 2
print(counter)

Submission status: Accepted

Solution code:
import sys
from functools import reduce
import copy
import math
from pprint import pprint
import collections
import bisect


sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def int_inputs(num_of_input):
    ins = [int(input()) for i in range(num_of_input)]
    return ins


def solve(inputs):
    X = int(inputs[0])
    r = X
    count = 0
    count += (r // 11) * 2
    r = r % 11
    if r > 6:
        count += 2
    elif r > 0:
        count += 1
    return count


def string_to_int(string):
    return list(map(int, string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

Submission status: Accepted

Solution code:
#C
X = int(input())
ans = (X//11)*2
res = X%11
if res == 0:
    pass
elif res <= 6:
    ans+=1
else:
    ans+=2
    
print(ans)

Submission status: Accepted

Solution code:
x =  int(input())

div = x // 11
mod = x % 11

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC053C
x = int(input())
ans = (x // 11) * 2

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

Submission status: Accepted

Solution code:
x = int(input())
#6, 5を交互に行き来するのが最適
ans = (x // 11) * 2
if x % 11 == 0:
    print(ans)
elif x % 11 < 7:
    print(ans + 1)
else:
    print(ans + 2)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
x = int(input())
a = x // 11 * 2
b = x % 11
res = a + (b + 5) // 6
print(res)

Submission status: Accepted

Solution code:
X = int(input())
A = X // 11
B = X % 11
if B == 0:
    print(A * 2)
elif B <= 6:
    print(A * 2 + 1)
else:
    print(A * 2 + 2)

Submission status: Accepted

Solution code:
x = int(input())

# パフォーマンスのため、10000回の操作が何回必要かを記録
block_of_10000, remaining = divmod(x, 5 * 5000 + 6 * 5000)

count = 0
while remaining > 0:
    if count % 2 == 0:
        remaining -= 6
    else:
        remaining -= 5
    count += 1

print(block_of_10000 * 10000 + count)

Submission status: Accepted

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

Submission status: Accepted

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

if r > 0:
    ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
num = (x - 1) // 11
amari = x % 11
if 1 <= amari <= 6:
    add = 1
else:
    add = 2
print((num * 2) + add)

Submission status: Accepted

Solution code:
x = int(input())

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

if amari > 0:
    ans += 1
    amari -= 6

if amari > 0:
    ans += 1
    amari -= 5
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# python3 (3.4.3)
import sys
input = sys.stdin.readline

# main
X = int(input())

print((X//11)*2 + (X%11+5)//6)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

a, t = 2*(x//11), x % 11

if t == 0:
    print(a)
elif t < 7:
    print(a+1)
else:
    print(a+2)

Submission status: Accepted

Solution code:
def examC():
    N = I()
    ans = (N // 11) * 2
    cur = N%11
    if 1<=cur:
        ans += 1
    if 6<cur:
        ans +=1
    print(ans)

import sys
import copy
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examC()

Submission status: Accepted

Solution code:
import math
x = int(input())
a, b = x // 11, x % 11
print(a * 2 + math.ceil(b / 6))

Submission status: Accepted

Solution code:
def ans(x):
    r = x % 11
    q = x // 11
    if r == 0:
        return 2*q
    elif 1 <= r and r <= 6:
        return 2*q+1 
    else:
        return 2*q+2 

x = int(input())
print(ans(x))

Submission status: Accepted

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

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

    print(ans)




if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

    print(ans)



if __name__ == "__main__":
    main()

Submission status: Accepted

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

    c = (N - 1) // 11
    if N <= (11 * c) + 6:
        print(2 * c + 1)
    else:
        print(2 * c + 2)




if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    if N <= 6:
        print(1)
    else:
        c = N // 11
        if N == c * 11:
            print(2 * c)
        elif N <= c * 11 + 6:
            print(c * 2 + 1)
        else:
            print(c * 2 + 2)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
x = int(input())

n = (x//11)
i = 0
now = n*11
while(1):
  i += 1
  if x%11 == 0:
    print(2*n)
    break
  if i%2 == 1:
    now += 6
    if now >= x:
      print(2*n + 1)
      break
  else:
    now += 5
    if now >= x:
      print(2*n + 2)
      break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
n = int(input())
  
a = math.floor((n / 11))*2
amari = n % 11
if amari == 0:
  print(a)
  exit(0)
  
if amari <= 6:
  print(a + 1)
  exit(0)

if amari > 6:
  print(a + 2)
  exit(0)

print(a)

Submission status: Accepted

Solution code:
n = int(input())
ans = 0
if n > 11:
    ans += (n // 11) * 2
    n = n % 11
i = 0
while i < n:
    if i % 2 == 0:
        i += 6
    else:
        i += 5
    ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
ans = (N // 11) * 2
if N%11 == 0:
    ans = ans
elif N%11 != 0 and N%11 <= 6:
    ans += 1
else:
    ans += 2
print(ans)

Submission status: Accepted

Solution code:
X = int(input())

def main():
    q, r = divmod(X, 11)
    rest = 2 if r > 6 else 1 if r > 0 else 0
    print(q * 2 + rest)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


main()

Submission status: Accepted

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


main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(x: int):
    amari = x%11
    answer = x//11*2
    if amari>6:
        answer+=2
    elif amari>0:
        answer+=1
    
    print(answer)
    return


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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections
import itertools
import functools
import math

if __name__ == "__main__":
    x = int(input())
    print((x // 11) * 2 + int(x % 11 > 6) + int(x % 11 > 0))

Submission status: Accepted

Solution code:
x=int(input())
a=x//11
b=a*11
a*=2
if b<x:
    b+=6
    a+=1
    if b<x:
        b+=5
        a+=1
print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
ret = (x//11)*2
y = x%11
if y >= 1 and y <= 6:
    ret += 1
elif y >= 7:
    ret += 2
print(ret)

Submission status: Accepted

Solution code:
x = int(input())

cnt = 0
num = 0

n = x%11
cnt = (x//11)*2

if n <=6 and n!=0:
    cnt += 1
elif n>=7 and n!=0:
    cnt += 2

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
n, rest = divmod(x, 11)
if rest >= 7:
    print(n * 2 + 2)
elif rest >= 1:
    print(n * 2 + 1)
else:
    print(n * 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())

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

Submission status: Accepted

Solution code:
n = int(input())
m = n // 11
l = n%11
if l ==0:
    a=0
elif 0<l<=6:
    a =1
elif 7<=l<=10:
    a=2
print(2*m + a)

Submission status: Accepted

Solution code:
x = int(input())

print((x // 11) * 2 + ((x % 11) + 5) // 6)

Submission status: Accepted

Solution code:
# C - X: Yet Another Die Game

x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
total = (x // 11) * 2
rest = x % 11
if 1 <= rest <= 6:
    total += 1
elif rest >= 7:
    total += 2
print(total)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC053 C - X: Yet Another Die Game
x = int(input())
n = 0
ans = 0
n = x//11

if 1<= x%11 <=6:
    ans = 2*n+1
elif 7<= x%11 <=10:
    ans = 2*n+2
elif x%11 == 0:
    ans = 2*n

print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
x=int(input())

ans=x//11*2

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

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

def main():
  n = ni()
  ans = n // 11 * 2
  if 0 < n % 11 < 7:
    ans += 1
  elif n % 11 > 6:
    ans += 2
  print(ans)
main()

Submission status: Accepted

Solution code:
n=int(input())
a=2*(n//11)
b=(n%11)//6
c=n%11 %6
print(a+b+((c+4)//5))

Submission status: Accepted

Solution code:
x = int(input())

count = x // 11 * 2

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
n, rest = divmod(x, 11)
if rest >= 7:
    print(n * 2 + 2)
elif rest >= 1:
    print(n * 2 + 1)
else:
    print(n * 2)