#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int T;
void solve() {
  int n = 0;
  string s;
  cin >> s;
  reverse(s.begin(), s.end());
  stringstream a(s);
  a >> n;
  int ans = 0;
  while (n) {
    ans <<= 1;
    if (n % 10 == 4)
      ans++;
    else
      ans += 2;
    n /= 10;
  }
  cout << ans << "\n";
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  T = 1;
  while (T--) solve();
}

### Prompt

Create a solution in CPP for the following problem:

Once again Tavas started eating coffee mix without water! Keione told him that it smells awful, but he didn't stop doing that. That's why Keione told his smart friend, SaDDas to punish him! SaDDas took Tavas' headphones and told him: "If you solve the following problem, I'll return it to you."

<image>

The problem is: 

You are given a lucky number n. Lucky numbers are the positive integers whose decimal representations contain only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.

If we sort all lucky numbers in increasing order, what's the 1-based index of n? 

Tavas is not as smart as SaDDas, so he asked you to do him a favor and solve this problem so he can have his headphones back.

Input

The first and only line of input contains a lucky number n (1 ≤ n ≤ 109).

Output

Print the index of n among all lucky numbers.

Examples

Input

4


Output

1


Input

7


Output

2


Input

77


Output

6

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
int T;
void solve() {
  int n = 0;
  string s;
  cin >> s;
  reverse(s.begin(), s.end());
  stringstream a(s);
  a >> n;
  int ans = 0;
  while (n) {
    ans <<= 1;
    if (n % 10 == 4)
      ans++;
    else
      ans += 2;
    n /= 10;
  }
  cout << ans << "\n";
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  T = 1;
  while (T--) solve();
}

```