Go: package main

import "fmt"

func main() {
	week := []string{"sun", "mon", "tue", "wed", "thu", "fri", "sat"}

	var day int
	fmt.Scan(&day)
	fmt.Println(week[(day+4)%7])//土曜日が9日という基準に揃えるために+4
}

C++: /* template.cpp(shinobu_menkoi) {{{ */
// C
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif

// C++

#include <algorithm>
#include <complex>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif

using namespace std;

// clang-format off
#define GET_MACRO(_1, _2, _3, _4, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rep1(n) rep2(_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, a, n) rep4(i, a, n, 1)
#define rep4(i, a, n, s) for (lint i = (a); i < (lint)(n); i += (s))
#define rrep(...) GET_MACRO(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define rrep1(a) rrep2(_, a)
#define rrep2(i, a) rrep3(i, a, 0)
#define rrep3(i, a, n) rrep4(i, a, n, 1)
#define rrep4(i, a, n, s) for (lint i = (a); i >= (lint)(n); i -= (s))
#define each(i, ctn) for (auto &&i : (ctn))

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(v) begin(v), end(v)
#define debug(x) cerr << (x) << " (L:" << __LINE__ << ")" << '\n'
#define TEMP_T template <class T>
#define TEMP_TU template <class T, class U>

TEMP_T using vec = vector<T>;
TEMP_T using heap = priority_queue<T>;
TEMP_T using minheap = priority_queue<T, vec<T>, greater<T>>;
using lint = long long;
using ulint = unsigned long long;
using ld = long double;
using vi = vec<int>;
using vvi = vec<vi>;
using vvvi = vec<vvi>;
using pii = pair<int, int>;
using vs = vec<string>;

TEMP_TU ostream &operator<<(ostream &os, const pair<T, U> &p) { return os << p.fi << " " << p.se; }
TEMP_TU istream &operator>>(istream &is, pair<T, U> &p) { return is >> p.fi >> p.se; }

constexpr int INF{1001001001};
constexpr lint LINF{1001001001001001001ll};
constexpr int MOD{(int)1e9 + 7};
constexpr double EPS{1e-9};
const double PI{acos(-1)};
constexpr int dx[]{0, 1, 0, -1, 1, -1, 1, -1}, dy[]{1, 0, -1, 0, 1, -1, -1, 1};

inline bool inside(int y, int x, int h, int w) { return y >= 0 && x >= 0 && y < h && x < w; }
TEMP_T inline bool chmin(T &a, const T &b) { if (a > b) a = b; return a > b; }
TEMP_T inline bool chmax(T &a, const T &b) { if (a < b) a = b; return a < b; }
TEMP_T inline void print(const T &x) { cout << x << '\n'; }
TEMP_T inline void print(const vec<T> &v, string d = "\n") { rep(i, v.size()) cout << v[i] << (i == (lint)(v.size() - 1) ? "\n" : d); }
template <class T = int> inline T in() { T x; cin >> x; return x; }
template <class T = string> vec<T> split(const string &s, char d = ',') {
  vec<T> v; stringstream ss(s); for (string b; getline(ss, b, d); ) {
    stringstream conv(b); T t; conv >> t; v.eb(t); } return v;
}
struct pre_ { pre_() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(12); } } pre__;
// clang-format on
/* }}} */

const string s[] = {"thu", "fri", "sat", "sun", "mon", "tue", "wed"};

signed main() {
  int x = in();
  print(s[x % 7]);
}

C++: #include <bits/stdc++.h>
using namespace std;

int main(){
  int a;
  cin>>a;
  if(a%7==1){
    cout<<"fri"<<endl;
  }else if(a%7==2){
    cout<<"sat"<<endl;
  }else if(a%7==3){
    cout<<"sun"<<endl;
  }else if(a%7==4){
    cout<<"mon"<<endl;
  }else if(a%7==5){
    cout<<"tue"<<endl;
  }else if(a%7==6){
    cout<<"wed"<<endl;
  }else{
    cout<<"thu"<<endl;
  }
    
  
  return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
    string D[] = {"thu", "fri", "sat", "sun", "mon", "tue", "wed"};
    int x; cin >> x;
    cout << D[x%7] << endl;
}

C++: #include<iostream>
using namespace std;

int main(){
	short date;
	cin>>date;
	date %= 7;
	if(date==0)
		cout<<"thu"<<endl; 
	switch(date){
		case 4:
			cout<<"mon"<<endl;
			break;
		case 5:
			cout<<"tue"<<endl;
			break;
		case 6:
			cout<<"wed"<<endl;
			break;
		case 7:
			cout<<"thu"<<endl;
			break;
		case 1:
			cout<<"fri"<<endl;
			break;
		case 2:
			cout<<"sat"<<endl;
			break;
		case 3:
			cout<<"sun"<<endl;
			break;
	}
	return 0;	
}

C++: #include <bits/stdc++.h>

#define rep(i,n) for(long long int (i)=0;(i)<(int)(n);(i)++)
#define rrep(i,a,b) for(long long int i=(a);i<(b);i++)
#define rrrep(i,a,b) for(long long int i=(a);i>=(b);i--)
#define all(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define Abs(a,b) max(a,b)-min(a,b)
#define YES(condition) if(condition){cout << "YES" << endl;}else{cout << "NO" << endl;}
#define Yes(condition) if(condition){cout << "Yes" << endl;}else{cout << "No" << endl;}
#define Cout(x) cout<<(x)<<endl
#define POSSIBLE(condition) if(condition){cout << "POSSIBLE" << endl;}else{cout << "IMPOSSIBLE" << endl;}
#define Possible(condition) if(condition){cout << "Possible" << endl;}else{cout << "Impossible" << endl;}
#define possible(condition) if(condition){cout << "possible" << endl;}else{cout << "impossible" << endl;}
#define Size(n) (n).size()

typedef long long ll;


using namespace std;

const int INF = 1e9,MOD = 1e9 + 7,ohara = 1e6;
const ll LINF = 1e18;


long long int n,cnt=0,ans=0,a,b,c,d,cmp,cmpp,m,h,w,x,y,sum=0,pos;
int dy[]={1,0,-1,0};
int dx[]={0,1,0,-1};
string alph("abcdefghijklmnopqrstuvwxyz"),s;
bool fl;
struct edge{int to,cost;};

//-------------------------↓↓↓↓↓↓------------------------

int main(void){
       cin.tie(0);
    ios::sync_with_stdio(false);

      
     cin >> x;
     if(x % 7 == 0)Cout("thu");
     else if(x % 7 == 1)Cout("fri");
     else if(x % 7 == 2)Cout("sat");
     else if(x % 7 == 3)Cout("sun");
     else if(x % 7 == 4)Cout("mon");
     else if(x % 7 == 5)Cout("tue");
     else if(x % 7 == 6)Cout("wed");
     

       
return 0;
}

C++: #include <iostream>
using namespace std;
int main(void){
    string D[] = {"thu", "fri", "sat", "sun", "mon", "tue", "wed"};
    int x; cin >> x;
    cout << D[x%7] << endl;// Your code here!
    
}

C++: #include<iostream>
using namespace std;

int main(){
  int X;
  cin>>X;

  switch(X%7){
    case 0:cout<<"thu";break;
    case 1:cout<<"fri";break;
    case 2:cout<<"sat";break;
    case 3:cout<<"sun";break;
    case 4:cout<<"mon";break;
    case 5:cout<<"tue";break;
    case 6:cout<<"wed";break;
  }
  cout<<endl;
}

C++: #include "bits/stdc++.h"
using namespace std;
int main(){
    int a,b;
    cin>>a;
    if(a%7==6)cout<<"wed"<<endl;
    if(a%7==5)cout<<"tue"<<endl;
    if(a%7==4)cout<<"mon"<<endl;
    if(a%7==3)cout<<"sun"<<endl;
    if(a%7==2)cout<<"sat"<<endl;
    if(a%7==1)cout<<"fri"<<endl;
    if(a%7==0)cout<<"thu"<<endl;
    return 0;
}