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:
from sys import stdin
x = int(stdin.readline().rstrip())
if x % 11 == 0:
    print(2*(x//11))
elif x%11 > 6:
    print(2*(x//11)+2)
else:
    print(2*(x//11)+1)

Submission status: Accepted

Solution code:
a = int(input())
print(int((a + 4.5) // 5.5))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

ans = N // 11
tmp = N - 11 * ans
ans *= 2
if tmp > 6:
    ans += 2
elif tmp > 0:
    ans += 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
x = int(input())
ans = 2 * (x // 11)
print(ans + (x % 11) // 7 + bool(x % 11))

Submission status: Accepted

Solution code:
import math

x = int(input())
ans = 2 * (x // 11)

print(ans + (x % 11) // 7 + bool(x % 11))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ARC068C - X: Yet Another Die Game (ABC053C)
def main():
    x = int(input())
    ans, r = x // 11 * 2, x % 11  # r: remainder
    if r != 0:
        ans += 1 if x % 11 <= 6 else 2
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# ARC068C - X: Yet Another Die Game (ABC053C)
def main():
    x = int(input())
    ans, r = x // 11 * 2, x % 11
    if r != 0:
        ans = ans + 1 if x % 11 <= 6 else ans + 2
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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:
# -*- coding: utf-8 -*-
"""
C - X: Yet Another Die Game
https://atcoder.jp/contests/arc068/tasks/arc068_a

"""
import sys


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


def main(args):
    x = int(input())
    ans = solve(x)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Accepted

Solution code:
n=int(input())
print((n+10)//11*2-(0<n%11<7))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

t = x // 11

if 11 * t == x:
    result = 2 * t

elif 11 * t + 6 >= x :
    result = 2 * t + 1

else:
    result = 2 * t + 2
    
print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
dim, mod = divmod(int(input()), 11)
print(dim * 2 + (1 if 7>mod else 2)*(mod>0))

Submission status: Accepted

Solution code:
x = int(input())

res = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())


syo = x // 11
amari = x % 11
PiecesOfUsuedNumbers = 2
if amari == 0:
    ans = syo * PiecesOfUsuedNumbers
elif 0 < amari <= 6:
    ans = syo * PiecesOfUsuedNumbers + 1
else:
    ans = syo * PiecesOfUsuedNumbers + 2


print(ans)

Submission status: Accepted

Solution code:
x = int(input())


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


print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

print(ans)

Submission status: Accepted

Solution code:
# -*- Coding: utf-8 -*-

n = int(input())
trial_num = 0

n_reminder = n % 11

if(n_reminder == 0):
    print(n//11 * 2)
elif(0 < n_reminder <= 6):
    print((n//11)*2 + 1)
elif(7 <= n_reminder <= 11):
    print((n//11)*2 + 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x =  int(input())

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

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

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
n=int(input());print(n//11*2+1+(n%11>6)-(n%11==0))

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    x = f()[0]
    y = x//11 * 2
    if x%11:
        y+=1
    if x%11>6:
        y +=1
    print(y)

solve()

Submission status: Accepted

Solution code:
x = int(input())
count = 0
c = 0
count = x // 11
y = x - count * 11
count *= 2
if 0 < y <= 6:
  count += 1
elif 6 <= y <= 10:
  count += 2


print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import collections
ns = lambda: sys.stdin.readline().rstrip()
ni = lambda: int(ns())
nm = lambda: map(int, sys.stdin.readline().split())
nl = lambda: list(nm())
nsl = lambda: map(str, sys.stdin.readline().split())

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

Submission status: Accepted

Solution code:
x = int(input())
count = 0
a = x//11 #2回セットで考えると11が得点の最大
count += 2*a
if(x%11 != 0):  
  b = x - 11*a
  if(1<=b<=6): count += 1
  else: count += 2
print(count)

Submission status: Accepted

Solution code:
from functools import reduce
import math

def main():
    # N! を求める
    # f = math.factorial(N)
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    # 1e10

    # 初期値用:十分小さい数(-100億)
    # -1e10
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    
    x = int(input().rstrip())
    if x <= 6:
        ans = 1
    elif x <=11:
        ans = 2
    else:
        if(x%11 == 0):
            ans = (x // 11) * 2
        elif(x%11 <= 6):
            ans = (x // 11) * 2 +1
        else:
            ans = (x // 11) * 2 +2
    print(ans)
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x = input()

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

Submission status: Accepted

Solution code:
x = int(input())

mod = x % 11

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

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())
y = x//11
x %= 11
z = 0
if 0 < x < 7:
  z = 1
elif 6 < x < 11:
  z = 2
print(y*2+z)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
from functools import partial, reduce
from operator import mul
prod = partial(reduce, mul)
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 II(): return int(sys.stdin.readline())
def SI(): return input()

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

print(main())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on 2019/2/24
Solved on 2019/2/
@author: shinjisu
"""


# ABC 076 C Explanation
def getInt(): return int(input())


def getIntList(): return [int(x) for x in input().split()]


def zeros(n): return [0]*n


def getIntLines(n): return [int(input()) for i in range(n)]


def getIntMat(n):
    mat = []
    for i in range(n):
        mat.append(getIntList())
    return mat


def zeros2(n, m): return [zeros(m)]*n


ALPHABET = [chr(i+ord('a')) for i in range(26)]
DIGIT = [chr(i+ord('0')) for i in range(10)]
N1097 = 10**9 + 7


def dmp(x, cmt=''):
    global debug
    if debug:
        if cmt != '':
            print(cmt, ':  ', end='')
        print(x)
    return x


def probC():
    N = getInt()
    dmp(N)
    count = N // (5+6) * 2
    rem = N % (5+6)
    if rem > 6:
        count += 2
    elif rem > 0:
        count += 1
    return count


debug = False  # True False
ans = probC()
print(ans)
#for row in ans:
#    print(row)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Jan 20 16:07:45 2019

@author: Yamazaki Kenichi
"""

x = int(input())

ans=0

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

print (ans)

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


def main():
    from math import ceil

    x = int(input())
    ans = ceil(2 * x / 11)

    if x % 11 == 6:
        ans -= 1

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x = int(input())

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())
count = 0
if a % 11 < 7 and a % 11 != 0:
    count += 1
elif a % 11 != 0:
    count += 2
count += (a // 11) * 2
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import collections
import math
from collections import Counter
from collections import deque


x = int(input())

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


if d == 0:
    pass
elif d >= 7:
    ans += 2
else:
    ans += 1

print(ans)

sys.exit(0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
x = int(raw_input())

y=x%11

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
ans = 0
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())

n, m = divmod(X, 11)

r = n * 2

if m == 0:
    pass
elif 1 <= m <= 6:
    r += 1
else:
    r += 2

print(r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import exit, setrecursionlimit, stderr
from functools import reduce
from itertools import *
from collections import *
from bisect import *

def read():
  return int(input())
 
def reads():
  return [int(x) for x in input().split()]

x = read()
ans = x // 11 * 2 + int(x % 11 > 0) + int(x % 11 > 6)
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
x = int(input())

if x<=6:
    print(1)
    exit()
if x<=11:
    print(2)
    exit()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import sys
x=int(input())
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
mod = x%11

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

Submission status: Accepted

Solution code:
X = int(input())

ans = ((X//11)+1)*2

if X%11>=1 and X%11<=6: ans -= 1
elif X%11==0: ans -= 2

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
def inpl(): return list(map(int, input().split()))
 
x = int(input())
res = 0
res += (x//11)*2
if x%11 > 6:
    res += 2
elif x%11 > 0:
    res += 1
else:
    res += 0

print(res)

Submission status: Accepted

Solution code:
import math

X=int(input())

res=0

if X <= 5:
	res = 1
else:
	res = math.ceil(X/11)
	res *= 2
	mod = X % 11
	if mod > 0 and mod <= 6:
		res-=1

print(res)

Submission status: Accepted

Solution code:
x = int(input())

a = int(x / 11)
b = x - 11 * a

if b > 6:
    c = 2
elif b == 0:
    c = 0
else:
    c = 1

print(a * 2 + c)

Submission status: Accepted

Solution code:
from math import ceil
print(ceil((int(input())-6)/11*2)+1)

Submission status: Accepted

Solution code:
from math import ceil
def main(): print(ceil((int(input())-6)/11*2)+1)
if __name__ == "__main__": main()

Submission status: Accepted

Solution code:
x = int(input())

count = 2*(x // 11)

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

print(count)

Submission status: Accepted

Solution code:
def die():
	x = int(raw_input())
	ans = (x/11)*2
	x = x%11
	c_sum = 0
	_temp = 5
	while c_sum<x:
		if _temp==5:
			c_sum+=6
			_temp=6
			ans+=1
		else:
			c_sum += 5
			_temp = 5
			ans += 1
	print ans

if __name__ == "__main__":
	die()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math
import sys
import itertools
import numpy as np
import functools
r = range

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    x = int(raw_input())
    if x > 6:
       if (x - 6) % 11 == 0:
           op1 = (x - 6)/11
           op2 = x/11 + 1
       elif x % 11 == 0 :
           op1 = (x - 6)/11 + 1
           op2 = x/11
       else:
           op1 = (x - 6)/11 + 1
           op2 = x/11 + 1
       return op1+op2
    else:
        return 1
print main()

Submission status: Accepted

Solution code:
#int input
n = int(input())

def another_dice_game(goal):
    d,m = divmod(goal,11)
    if m == 0:
        return d * 2
    elif m <= 6:
        return d * 2+ 1
    else:
        return d * 2 + 2

print(another_dice_game(n))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

n = 2*(x // 11)

if x%11 != 0:
	if x % 11 <= 6:
		n += 1
	else:
		n += 2

print(n)

Submission status: Accepted

Solution code:
import math
target = int(input())
if 0 < target % 11 < 6:
    print(math.floor(target / 11 * 2) + 1)
elif target % 11 == 6:
    print(math.floor(target / 11 * 2))
else:
    print(math.ceil(target / 11 * 2))

Submission status: Accepted

Solution code:
x = input()

r = x % 11
if r == 0:
    sum = 0
elif r <= 6:
    sum = 1
else:
    sum = 2

sum += x / 11 * 2
print sum

Submission status: Accepted

Solution code:
x=int(input())

y=int(x/11)*2

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

print(y)

Submission status: Accepted

Solution code:
#ARC068C

n=int(raw_input())

res=n/11*2
ref=n%11
if ref==0:
 print res
elif ref<=6:
 print res+1
else:
 print res+2

Submission status: Accepted

Solution code:
I = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

q = x // 11
r = x % 11

ans = 2 * q
if r == 0:
    pass
elif r <= 6:
    ans += 1
else:
    ans += 2

print(ans)

Submission status: Accepted

Solution code:
x = int(input())

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

print(ans)

Submission status: Accepted

Solution code:
target_score = int(input())

cnt = target_score // 11 * 2
target_score = target_score % 11


if target_score == 0:
    print(cnt)
elif target_score <= 6:
    print(cnt + 1)
else:
    print(cnt + 2)

Submission status: Accepted

Solution code:
X = int(raw_input())
minZ = (X / 11)*2
remainder = X % 11
if remainder == 0:
   print minZ
elif remainder > 6:
   print minZ+2
else:
   print minZ+1

Submission status: Accepted

Solution code:
#C X: Yet Another Die Game
N = int(input())
baseNum = (N//11)*2
addNum = N%11
if addNum >6 :
    baseNum +=2
elif addNum >0 :
    baseNum +=1
print(baseNum)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def debug(x, table):
    for name, val in table.items():
        if x is val:
            print('DEBUG: {} -> {}'.format(name, val), file=sys.stderr)
            return None

x = int(input())

btm = 0
top = 10 ** 15

while top - btm > 1:
    mid = (top + btm) // 2
    if mid % 2 == 0:
        score = (mid // 2) * 11
    else:
        score = (mid // 2) * 11 + 6

    if score >= x:
        top = mid
    else:
        btm = mid

print(top)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
d, m = divmod(N, 11)
a = (1 if m else 0) if m < 7 else 2
print(d * 2 + a)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys

def s():
    return raw_input().strip()
def n():
    return int(raw_input())
def d():
    return float(raw_input())

def ls():
    return raw_input().strip().split()
def ln():
    return map(int, raw_input().strip().split())
def ld():
    return map(float, raw_input().strip().split())

def fs():
    return [raw_input().strip() for i in xrange(input())]
def fn():
    return [int(raw_input().strip()) for i in xrange(input())]
def fd():
    return [float(raw_input().strip()) for i in xrange(input())]

MOD = 10**9 + 7

x = n()

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

if r > 6:
    c += 2
elif r >= 1:
    c += 1

print c

Submission status: Accepted

Solution code:
import sys

cin = sys.stdin

x = int(cin.readline())
c = x//11
cnt = c*2
r = x%11
# print(r)
if r>0:
    cnt +=1
    if r>6:
        cnt +=1

print(cnt)

Submission status: Accepted

Solution code:
import math
x = input();
x = int(x)-6
x = math.ceil(x/11*2)+1

print(x)

Submission status: Accepted

Solution code:
n=int(input())
if n<7:
    print(1)
elif n<12:
    print(2)
else:
    ans=n//11*2
    print(ans+[1,2][n%11>6] if n%11 else ans)

Submission status: Accepted

Solution code:
N = int(input())

if N < 11:
    d, m = divmod(N, 6)
    print(d + (m>0))
else:
    d, m = divmod(N, 11)
    a = (1 if m else 0) if m < 7 else 2
    print(d * 2 + a)

Submission status: Accepted

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

__main__()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def solve(x):
    q = (x - 1) // 11
    r = (x - 1) % 11
    if r <= 5:
        return 2 * q + 1
    return 2 * q + 2

x = int(input())
print(solve(x))

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding:utf-8 -*-

import math


x = int(input())
tmp = int(math.ceil(x / 11.0 * 2.0))
# print(11 * tmp // 2)
# print(tmp)
if (11 * tmp) // 2 - 5 >= x:
    print(tmp-1)
else:
    print(tmp)

Submission status: Accepted

Solution code:
#import string,itertools,fractions,heapq,re,array,bisect
#from math import *
#from collections import Counter
def rl(s): return xrange(len(s))

INF = 2147483647


import sys
stdin = sys.stdin

D =        int( stdin.readline().strip() )

n = D // 11
r = D % 11
n *= 2
if r != 0:
    if r <= 6:
        n += 1
    else:
        n += 2

print n

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

Solution code:
x = int(input())
ans = 0

ans += 2 * (x // (5 + 6))
x %= (5 + 6)

ans += x // 6
x %= 6

if x != 0:
    ans += 1

print(ans)

Submission status: Accepted

Solution code:
x=int(raw_input());
y=x/11;
z=0;
if x%11>0 :
    if x%11>6 :
        z=2;
    else:
        z=1;

print str(x/11*2+z);

Submission status: Accepted

Solution code:

n = int(input())

res = int(n/11)
amari = n%11

if amari>=7:
	amari=2
elif amari==0:
	amari = 0
else:
	amari=1

print(res*2+amari)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def debug(x, table):
    for name, val in table.items():
        if x is val:
            print('DEBUG: {} -> {}'.format(name, val), file=sys.stderr)
            return None

x = int(input())

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

if x > 0:
    if x > 6:
        ans += 2
    else:
        ans += 1

print(ans)