Go: package main

import (
	"fmt"
	"strings"
	"bufio"
	"os"
	// "reflect"
	"strconv"
)

func oneLineInt(s string) []int {
	temp := strings.Split(s, " ")
	// fmt.Println(len(temp))
	ints := []int{}
	for _, elem := range(temp) {
		int_elem, _ := strconv.Atoi(elem)
		ints = append(ints, int_elem)
	}
	return ints
}

func coinCount(ints []int) int {
	cons := ints[0]
	bonus := ints[1]
	target := ints[2]
	count := 0
	day := 0
	var dc int
	for day_count, _ := range(make([]int, target)) {
		day++
		if day % 7 == 0 {
			count += bonus
		}
		count += cons
		if count >= target {
			dc = day_count + 1
			break
		}
	}
	return dc
}

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	var txt string
	if scanner.Scan() {
		txt = scanner.Text()
	}
	ints := oneLineInt(txt)
	// fmt.Println(ints[1])
	// fmt.Println(reflect.TypeOf(ints[0]))
	result := coinCount(ints)
	fmt.Println(result)
}

Python: #
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
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():
    A,B,C = MI()
    ans = 7*(C//(A*7+B)) #1週間
    C %= A*7+B
    ans += min(7,ceil(C/A))
    print(ans)


if __name__ == '__main__':
    main()

Python: A, B, C = map(int, input().split())
ans = 0
k = C // (7*A+B)
C -= k*(7*A+B)
if C <= 7*A:
    print(7*k + (C+A-1)//A)
else:
    print(7*(k+1))

Python: A,B,C=map(int,input().split())

coin=0
for day in range(1,C+1):
    coin+=A
    if day%7==0:
        coin+=B
    if coin>=C:
        break

print(day)

Python: A, B, C = map(int,input().split())

coin = 0
for day in range(1, C+1):
    coin+=A
    
    if day%7==0:
        coin+=B
    if coin >= C: break

print(day)

Python: A,B,C = map(int,input().split())

coin=0
for day in range(1, C+1):
    coin+=A
    #月曜日から日曜日まで 7 日連続でログインすると
    if day % 7 == 0:
        coin+=B
    if coin >= C: break

print(day)

Python: import math
line = input().split(" ")
A = int(line[0])
B = int(line[1])
C = int(line[2])

W = C//(7*A+B)
remain = C - (7*A+B)*W
#print(W, " ", remain)
D = 0
if(remain >= 7*A):
    D = 7 
else:
    D = math.ceil(remain/A)

ans = 7*W + D

print(ans)

Python: a,b,c=map(int,input().split())

d=0
s=0
while s<c:
    d +=1
    if d%7==0:
        s +=b
    s +=a
print(d)

Python: a,b,c = map(int,input().split())

d = 0
s = 0
while s < c:
    d += 1
    if d%7 == 0:
        s += b
    s += a
print(d)

Python: # -*- coding: utf-8 -*-
# 学籍番号 17D8101029G 石塚 博之 ID: mcatpolo 言語: python3

a,b,c = map(int, input().split())

n = int(0)
i = int(0)

while True:
    i += 1
    n += a
    if i%7 == 0:
        n+=b

    if n >= c:
        break

print(i)

Python: 
a,b,c=map(int,input().split())
#b=int(input())
#c=int(input())
day=0
cnt=0
while(True):
    day+=1
    #print(day)
    #print(c)
    if day%7==0:
        c-=b
    c-=a
    if c<=0:
        break
print(day)

Python: A,B,C = map(int,input().split())

coin=0
for day in range(1,C+1):
    coin+=A
    if day % 7 == 0:
        coin+=B
    if coin >=C:
        break
        
print(day)

Python: a,b,c=map(int,input().split())

coin=0
for day in range(1,c+1):
    coin+=a
    #月曜から日曜まで連続でログイン
    if day % 7 == 0:
        coin+=b
    if coin >= c: break
print(day)

Python: a,b,c = map(int,input().split())

day = 0
coin = 0

while coin < c:
    day += 1
    coin += a
    if day % 7 == 0:
        coin += b


print(day)

Python: a,b,c=map(int,input().split())
i=1
result=0
while True:
    if result>=c:
        break
    result+= a
    if i%7==0:
        result+=b
    i+=1
print(i-1)

Python: A,B,C = map(int,input().split())
x = 0
y = 0
while x < C:
    y += 1
    if y%7 == 0:
        x += B
    x += A
print(y)

Python: a,b,c=map(int, input().split())

x=0
i=0

while x<c:
    x+=a
    i+=1
    
    if i%7==0:
        x+=b

print(i)

Python: a, b, c = map(int, input().split())
ans = c//(a*7+b)*7+min((c%(a*7+b)+a-1)//a,7)
print(ans)

Python: A,B,C=map(int,input().split())
x=A*7+B
y=C//(A*7+B)
z=x*y
w=C-z

if (A*7)<w<x:
    print((y+1)*7)
else:
    coin=0
    day=0
    while coin<w:
        coin+=A
        day+=1
    print(y*7+day)

Python: a,b,c=map(int,input().split())
d,e=0,0
while d<c:
    d +=a
    e +=1
    if e%7 == 0:
        d +=b
print(e)

Python: A,B,C=map(int,input().split())

coin=0
for day in range(1,C+1):
    coin+=A
    if day%7 ==0:
        coin+=B
    if coin>=C:
        break
print(day)

Python: A,B,C=map(int,input().split())

coin=0
for i in range(1,C+1):
    coin+=A
    if i%7==0:
        coin+=B
    if coin>=C:
        break
print(i)

Python: import sys
from sys import stdin

#input = stdin.readline()

A, B, C = input().split()
A = int(A)
B = int(B)
C = int(C)

def Process(A, B, C):    #その一週間のログイン計画を演算する
    got, login = 0, 0
    if C > (7*A+B):    #一週間フルでログインしてもまだ目標に到達しない場合.
        week, remain = divmod(C, (7*A+B))
        login += (7*week)
        got += ((7*A+B)*week)

    local_date = 1
    while C > got:
        got += A
        login += 1
        local_date += 1
        if local_date == 8:
            got += B
    return login

print(Process(A, B, C))

Python: A, B, C = map(int, input().split())
n = 0 
temp = 0 
while temp < C:
	n = n + 1
	if n % 7 == 0:
		temp = temp + A + B
	else:
		temp = temp + A

print(n)

Python: #!/usr/bin/python3

import array
from fractions import Fraction
import functools
import itertools
import math
import os
import sys


def main():
    A, B, C = read_ints()
    print(solve(A, B, C))


def solve(A, B, C):
    weekly = A * 7 + B
    weeks = C // weekly
    rest = C - weekly * weeks
    days = (rest + A - 1) // A
    if days > 7:
        days = 7
    return weeks * 7 + days


###############################################################################
# AUXILIARY FUNCTIONS

DEBUG = 'DEBUG' in os.environ


def inp():
    return sys.stdin.readline().rstrip()


def read_int():
    return int(inp())


def read_ints():
    return [int(e) for e in inp().split()]


def dprint(*value, sep=' ', end='\n'):
    if DEBUG:
        print(*value, sep=sep, end=end)


if __name__ == '__main__':
    main()

Python: A,B,C = map(int,input().split())
coin = 0
for day in range(1, C+1):
     coin += A
     if day % 7 == 0:
          coin += B
     if coin >= C:  break
print(day)

Python: A,B,C = map(int,input().split())

sum=0
cnt=0

for i in range(1,C+1):
    sum=sum+A
    if i%7==0:
        sum=sum+B
    if sum>=C:
        cnt=i
        break

print(cnt)

Python: a, b, c = map(int, input().split())
ans = 0
ans += c // (a * 7 + b) * 7
c %= (a * 7 + b)
ans += min(7, c // a)
if c % a and c // a < 7:
    ans += 1
print(ans)

Python: # coding: utf-8
# Your code here!
a,b,c=map(int,input().split())

sum=0
i=0
while True:
    sum+=a
    i+=1
    if sum>=c:
        print(i)
        break
    if i%7==0:
        sum+=b
        if sum>=c:
            print(i)
            break

Python: A,B,C=map(int, input().split())

coin=0
for day in range(1, C+1) :
    coin+=A
    if day % 7 == 0 :
        coin+=B
    if coin >= C : break 
print(day)